Unsupervised Clustering, Expectation Maximization, Gaussian Mixture Model, K Means Clustering, Tensorflow Probability.
series). EM algorithm guarantees convergence. It can handle complicated constraints in the maximization problem. It suffers from local maxima (does not guarantee global maxima), as convergence heavily depends on the choice of initial parameters. The figures below show intermediate visualizations of