Research map / Learning theory and algorithms / Sample complexity
Enhancing Nearest Neighbor Based Entropy Estimator for High Dimensional Distributions via Bootstrapping Local Ellipsoid
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
- Entropy Estimation via Normalizing Flow (AAAI 2022 · similarity 0.87)
- Breaking the Bandwidth Barrier: Geometrical Adaptive Entropy Estimation (NeurIPS 2016 · similarity 0.86)
- The Nearest Neighbor Information Estimator is Adaptively Near Minimax Rate-Optimal (NeurIPS 2018 · similarity 0.84)
- Uniform Convergence Rate of the Kernel Density Estimator Adaptive to Intrinsic Volume Dimension (ICML 2019 · similarity 0.83)
- Sparse Polyak: an adaptive step size rule for high-dimensional M-estimation (NeurIPS 2025 · similarity 0.81)
- Instance-Optimality for Private KL Distribution Estimation (NeurIPS 2025 · similarity 0.81)
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.