Research map / Learning theory and algorithms / Sample complexity
Training Gaussian Mixture Models at Scale via Coresets
Mario Lucic, Matthew Faulkner, Andreas Krause, Dan Feldman
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 coreset construction instead of uniform subsampling | GMM training · Higgs | relative log-likelihood error: 12.2% -> 4% | Improved |
| use coreset construction instead of uniform subsampling | GMM training · csn | relative log-likelihood error: 58.7% -> 6.6% | Improved |
| use coreset construction instead of uniform subsampling | GMM training · Kdd | relative log-likelihood error: 16.8% -> 2.7% | Improved |
| use coreset construction instead of uniform subsampling | GMM training · msyp | relative log-likelihood error: 3.9% -> 2.3% | Improved |
Closest papers by meaning
- Sublinear Variational Optimization of Gaussian Mixture Models with Millions to Billions of Parameters (NeurIPS 2026 · similarity 0.87)
- Coresets for Clustering Under Stochastic Noise (NeurIPS 2025 · similarity 0.86)
- Beyond Worst-Case Coreset Bounds for $k$-Clustering via Determinantal Sampling (NeurIPS 2026 · similarity 0.86)
- $\mathbb{D}^2$ Pruning: Message Passing for Balancing Diversity & Difficulty in Data Pruning (ICLR 2024 · similarity 0.86)
- Toward Global Convergence of Gradient EM for Over-Paramterized Gaussian Mixture Models (NeurIPS 2024 · similarity 0.85)
- Scaling Laws for Optimal Data Mixtures (NeurIPS 2025 · 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.
