General
Improved Bounds for the Entropic Central Limit Theorem in the Log-Concave Case
arXiv math.IT0 views
arXiv:2610.31493v1 Announce Type: new 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.
Source:https://arxiv.org/abs/2610.31493PreviousDeep holes of full-length Reed--Solomon codes: uniform bounds and exact classificationsNextThe Cheng-Murray Conjecture on Deep Holes of Full-Length Reed-Solomon Codes
Related posts
Vellinko – Sign PDFs in the browser without uploading them
0Hacker News New
Show HN: Vivio House, an interactive 3D headquarters
0Hacker News New
Pushover – Simple Notifications
0Hacker News New
The Gift of It's Your Problem Now (2021)
0Hacker News New
Implied News: News X Prediction Markets
0Hacker News New
Show HN: OpenDocBot - bring your own model to Word, Excel and PowerPoint
0Hacker News New