Research map / Learning theory and algorithms / Sample complexity
Estimation of Entropy in Constant Space with Improved Sample Complexity
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
- Estimating Entropy of Distributions in Constant Space (NeurIPS 2019 · similarity 0.92)
- Entropy testing and its application to testing Bayesian networks (NeurIPS 2024 · similarity 0.83)
- The Space Complexity of Approximating Logistic Loss (NeurIPS 2024 · similarity 0.82)
- A Separation in Heavy-Tailed Sampling: Gaussian vs. Stable Oracles for Proximal Samplers (NeurIPS 2024 · similarity 0.82)
- Accelerating Relative Entropy Coding with Space Partitioning (NeurIPS 2024 · similarity 0.82)
- Optimal Algorithms for Augmented Testing of Discrete Distributions (NeurIPS 2024 · similarity 0.82)
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.