arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1508.04093math.PRcs.ITmath.FAmath.IT
收藏

对数凹密度下的最优信息量集中

Optimal Concentration of Information Content For Log-Concave Densities

Matthieu Fradelizi, Mokshay Madiman, Liyao Wang

摘要:

给出了具有对数凹密度的随机向量的变熵以及信息量偏离其均值的精确界的一个初等证明。这些界限显著改进了Bobkov和Madiman({ \it Ann. Probab.},39(4):1528- 1543,2011)。

英文摘要:

An elementary proof is provided of sharp bounds for the varentropy of random vectors with log-concave densities, as well as for deviations of the information content from its mean. These bounds significantly improve on the bounds obtained by Bobkov and Madiman ({\it Ann. Probab.}, 39(4):1528--1543, 2011).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑