Research map / Learning theory and algorithms / Sample complexity
Theoretical guarantees for EM under misspecified Gaussian mixture models
Raaz Dwivedi, nhật Hồ, Koulik Khamaru, Martin J. Wainwright, Michael I Jordan
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 changed | Where | Measured | Effect |
|---|---|---|---|
| increase sample size n for sample-based EM | EM on misspecified Gaussian mixtures · Cases 1-3 simulations | statistical error: slope -0.50 | Improved |
| make fitted mixture weight pi closer to 0.5 (less unbalanced) | population EM, Case 3 · Case 3 simulation | convergence rate | Hurt |
| compare empirical bias scaling to theoretical bound for close components | Proposition 1 bound · Case 1 simulation | bias scaling exponent in rho: rho^2 (empirical) vs rho^1/4 (bound) | Mixed |
Closest papers by meaning
- Local Maxima in the Likelihood of Gaussian Mixture Models: Structural Results and Algorithmic Consequences (NeurIPS 2016 · similarity 0.89)
- Toward Global Convergence of Gradient EM for Over-Paramterized Gaussian Mixture Models (NeurIPS 2024 · similarity 0.88)
- Convergence of Gradient EM on Multi-component Mixture of Gaussians (NeurIPS 2017 · similarity 0.87)
- Convergence Guarantees for Gaussian Process Means With Misspecified Likelihoods and Smoothness (JMLR 2021 · similarity 0.87)
- Refined Convergence Rates for Maximum Likelihood Estimation under Finite Mixture Models (ICML 2022 · similarity 0.87)
- Is $\sqrt{d}$ Separation Necessary for Gradient EM to Learn Gaussian Mixtures in High Dimensions? (NeurIPS 2026 · similarity 0.86)
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.
