arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv math/0702653math.STstat.TH
收藏

从$ε$ -熵到KL-熵:最小信息复杂度密度估计分析

From $ε$-entropy to KL-entropy: Analysis of minimum information complexity density estimation

Tong Zhang

摘要:

我们考虑扩展的$ε$ -熵的KL-发散的随机密度估计方法的复杂性措施。基于此扩展,我们开发了一个一般的信息理论不等式,测量一些确定性和随机密度估计的统计复杂性。新的不平等的后果将被提出。特别是,我们表明,这种技术可以导致一些经典的结果有关的最小描述长度和贝叶斯后验分布的收敛性的改进。此外,我们能够推导出干净的有限样本收敛范围,是无法使用以前的方法。

英文摘要:

We consider an extension of $ε$-entropy to a KL-divergence based complexity measure for randomized density estimation methods. Based on this extension, we develop a general information-theoretical inequality that measures the statistical complexity of some deterministic and randomized density estimators. Consequences of the new inequality will be presented. In particular, we show that this technique can lead to improvements of some classical results concerning the convergence of minimum description length and Bayesian posterior distributions. Moreover, we are able to derive clean finite-sample convergence bounds that are not obtainable using previous approaches.

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

↑