Stanford CS229 Machine Learning | Spring 2026 | Lecture 10: GMM (EM), PCA
This lecture covers GMM via EM and PCA. It details how EM uses Jensen's inequality to construct a lower bound for optimization, while PCA finds maximal variance directions using Eigen Decomposition of the covariance matrix.
Read article