Research map / Learning theory and algorithms / Sample complexity
Breaking the Bandwidth Barrier: Geometrical Adaptive Entropy Estimation
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use LNN (k-th nearest neighbor based, Gamma-distributed/ exponential-spacing) entropy estimator with bias correction constant B_{k,d} | kLNN entropy estimator · theoretical (asymptotic consistency) | asymptotic bias of E[H_kLNN] | No clear effect |
Closest papers by meaning
- Private and Communication-Efficient Algorithms for Entropy Estimation (NeurIPS 2022 · similarity 0.87)
- Estimators for Multivariate Information Measures in General Probability Spaces (NeurIPS 2018 · similarity 0.86)
- Entropy Estimation via Normalizing Flow (AAAI 2022 · similarity 0.86)
- The Nearest Neighbor Information Estimator is Adaptively Near Minimax Rate-Optimal (NeurIPS 2018 · similarity 0.86)
- Structural-Entropy-Based Sample Selection for Efficient and Effective Learning (ICLR 2025 · similarity 0.84)
- Information-Theoretic Discrete Diffusion (NeurIPS 2025 · 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.