Research map / Learning theory and algorithms / Sample complexity
Learning Mixture of Gaussians with Streaming Data
Aditi Raghunathan, Prateek Jain, Ravishankar Krishnawamy
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 |
|---|---|---|---|
| Use soft, distribution-specific EM assignments instead of hard nearest-center assignments | Streaming center estimation for a balanced two-Gaussian mixture · Balanced mixture of two spherical Gaussians | expected squared mean-estimation error: removes the additional approximation error term | Improved |
Closest papers by meaning
- A Fourier Approach to Mixture Learning (NeurIPS 2022 · similarity 0.90)
- Sample-Efficient Private Learning of Mixtures of Gaussians (NeurIPS 2024 · similarity 0.86)
- Toward Global Convergence of Gradient EM for Over-Paramterized Gaussian Mixture Models (NeurIPS 2024 · similarity 0.85)
- Achieving Optimal Clustering in Gaussian Mixture Models with Anisotropic Covariance Structures (NeurIPS 2024 · similarity 0.85)
- Learning Mixtures of Gaussian Processes through Random Projection (ICML 2024 · similarity 0.85)
- Is $\sqrt{d}$ Separation Necessary for Gradient EM to Learn Gaussian Mixtures in High Dimensions? (NeurIPS 2026 · 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.
