Skip to content
Preprint

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

Oct 2026 · 0 citations · 23 references
Computer Science Mathematics

Abstract

Let $\mu$ be a log-concave isotropic probability measure on $R^d$ , and let $\mu^n$ denote the law of the normalized sum of $n$ independent random vectors with law $\mu$. We prove that \[ H(\mu^n|\gamma)\leq \frac{C}{n} \min\left\{1+\log(ed)^2H(\mu|\gamma)\ ,\ 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.

View source

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.