Research map / Learning theory and algorithms / Sample complexity
Efficient Deep Approximation of GMMs
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
- A closer look at the approximation capabilities of neural networks (ICLR 2020 · similarity 0.88)
- Asymptotic Analysis of Two-Layer Neural Networks after One Gradient Step under Gaussian Mixtures Data with Structure (ICLR 2025 · similarity 0.87)
- Non-Euclidean Universal Approximation (NeurIPS 2020 · similarity 0.86)
- Approximation to Smooth Functions by Low-Rank Swish Networks (ICML 2025 · similarity 0.85)
- Sublinear Variational Optimization of Gaussian Mixture Models with Millions to Billions of Parameters (NeurIPS 2026 · similarity 0.85)
- Bayes-optimal learning of an extensive-width neural network from quadratically many samples (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.