atlas

Research map / Learning theory and algorithms / Sample complexity

Local Maxima in the Likelihood of Gaussian Mixture Models: Structural Results and Algorithmic Consequences

NeurIPS 2016 · Learning theory and algorithms › Sample complexity · approach: Density and property estimation · 95 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Random initialization of EM (initial centers drawn from the mixture) versus converging to global optimum: EM converges to a bad critical point with probability at least 1-e^{-cM}EM algorithm on population likelihood of well-separated uniform spherical GMM · population GMM, M>=3 components, random initializationprobability of converging to bad critical pointHurt
Gradient-based first-order EM with constant step size s in (0,1) under random initializationfirst-order EM on population GMM likelihood · population GMM, M>=3 components, random initializationprobability of converging to bad critical pointHurt
Constant step size first-order EM (s in (0,1)) avoids convergence to strict saddle pointsfirst-order EM on population GMM likelihood · population GMM, random initializationprobability of converging to a strict saddle pointHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy