📖
Improved Bounds for the Entropic Central Limit Theorem in the Log-Concave Case
Tom Maitre

Improved Bounds for the Entropic Central Limit Theorem in the Log-Concave Case

Author / Organization:
Science & Mathematics Published 2026 Verification Pending

Overview & Synopsis

Let $μ$ be a log-concave isotropic probability measure on $R^d$ , and let $μ^n$ denote the law of the normalized sum of $n$ independent random vectors with law $μ$. We prove that \[ H(μ^n|γ)\leq \frac{C}{n} \min\left\{1+\log(ed)^2H(μ|γ)\ ,\ d\right\}. \] Compared to the previous best known bound, our estimate replaces the polynomial dependence on the dimension by a polylogarithmic one. The proof relies on a new combination of the De Bruijn identity with Eldan's stochastic localization process.

Indexed from repository: arXiv (arxiv.org)
Loading document from verified source...
Keyboard Shortcuts: ← / → for pages • + / - for zoom • 0 to fit width Powered by Mozilla PDF.js v3.11

Document Information

Document Title Improved Bounds for the Entropic Central Limit Theorem in the Log-Concave Case
Author / Organization Tom Maitre
Subject & Discipline cs.IT
Categories Science & Mathematics
Publication Year 2026
License / Rights arXiv Open Access / Creative Commons
Resource Verification Listed PDF (Verification Pending)
Original Host Website arXiv (arxiv.org)
File Format application/pdf (Portable Document Format)
Language EN
Catalog ID DOC-263373
Original Source Link Visit Source Page on arxiv.org »