Research map / Learning theory and algorithms / Sample complexity
Learning discrete distributions with infinite support
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
- Improved Distribution Estimation in $\ell_\infty$ (ICML 2026 · similarity 0.89)
- On the Asymptotic Distribution of the Minimum Empirical Risk (ICML 2024 · similarity 0.88)
- Toward a Characterization of Loss Functions for Distribution Learning (NeurIPS 2019 · similarity 0.88)
- The Empirical Mean is Minimax Optimal for Local Glivenko-Cantelli (ICML 2025 · similarity 0.88)
- Optimal Algorithms for Augmented Testing of Discrete Distributions (NeurIPS 2024 · similarity 0.87)
- Stability and Sharper Risk Bounds with Convergence Rate $\tilde{O}(1/n^2)$ (NeurIPS 2025 · similarity 0.86)
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.