Research map / Learning theory and algorithms / Sample complexity
Profile Entropy: A Fundamental Measure for the Learnability and Compressibility of Distributions
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
- On the Efficient Implementation of High Accuracy Optimality of Profile Maximum Likelihood (NeurIPS 2022 · similarity 0.88)
- The Broad Optimality of Profile Maximum Likelihood (NeurIPS 2019 · similarity 0.88)
- A General Framework for Symmetric Property Estimation (NeurIPS 2019 · similarity 0.87)
- Dimension-free empirical entropy estimation (NeurIPS 2021 · similarity 0.87)
- Structural-Entropy-Based Sample Selection for Efficient and Effective Learning (ICLR 2025 · similarity 0.85)
- Breaking the curse of dimensionality in structured density estimation (NeurIPS 2024 · similarity 0.84)
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.