Research map / Learning theory and algorithms / Sample complexity
Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes
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.
Closest papers by meaning
- Sample-Efficient Private Learning of Mixtures of Gaussians (NeurIPS 2024 · similarity 0.91)
- SQ Lower Bounds for Learning Mixtures of Linear Classifiers (NeurIPS 2023 · similarity 0.89)
- On Learning Parallel Pancakes with Mostly Uniform Weights (ICML 2025 · similarity 0.87)
- Learning multivariate Gaussians with imperfect advice (ICML 2025 · similarity 0.86)
- Optimal Sample Complexity of Contrastive Learning (ICLR 2024 · similarity 0.85)
- Sublinear Variational Optimization of Gaussian Mixture Models with Millions to Billions of Parameters (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.