Research map / Learning theory and algorithms / Sample complexity
Robust Model Selection and Nearly-Proper Learning for GMMs
Allen Liu, Jerry Li, Ankur Moitra
Read the paperCheck your idea against 137,217 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.
Closest papers by meaning
- Is $\sqrt{d}$ Separation Necessary for Gradient EM to Learn Gaussian Mixtures in High Dimensions? (NeurIPS 2026 · similarity 0.88)
- Learning Gaussian Mixtures with Generalized Linear Models: Precise Asymptotics in High-dimensions (NeurIPS 2021 · similarity 0.87)
- Toward Global Convergence of Gradient EM for Over-Paramterized Gaussian Mixture Models (NeurIPS 2024 · similarity 0.87)
- Sublinear Variational Optimization of Gaussian Mixture Models with Millions to Billions of Parameters (NeurIPS 2026 · similarity 0.87)
- On Learning Parallel Pancakes with Mostly Uniform Weights (ICML 2025 · similarity 0.86)
- Achieving Optimal Clustering in Gaussian Mixture Models with Anisotropic Covariance Structures (NeurIPS 2024 · similarity 0.85)
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.
