arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1805.01355cs.ITeess.SPmath.IT
收藏

大状态空间马氏链的极大极小冗余

Minimax redundancy for Markov chains with large state space

Kedar Shriram Tatwawadi, Jiantao Jiao, Tsachy Weissman

摘要:

对于任何马尔可夫信源,都存在通用码,其归一化码长随着样本数趋于无穷大而渐近地接近香农限。本文研究如何快速的归一化codelength的“最佳”通用压缩器和香农极限(即压缩冗余)之间的差距消失的非渐近的字母表的大小和混合时间的马尔可夫源。我们表明,马尔可夫源的弛豫时间至少是$1 + \frac{(2+c)}{\sqrt{k}}$,其中$k$是状态空间的大小(和$c>0$是一个常数),相变的样本数需要实现消失的压缩冗余正是$Θ(k^2)$。

英文摘要:

For any Markov source, there exist universal codes whose normalized codelength approaches the Shannon limit asymptotically as the number of samples goes to infinity. This paper investigates how fast the gap between the normalized codelength of the "best" universal compressor and the Shannon limit (i.e. the compression redundancy) vanishes non-asymptotically in terms of the alphabet size and mixing time of the Markov source. We show that, for Markov sources whose relaxation time is at least $1 + \frac{(2+c)}{\sqrt{k}}$, where $k$ is the state space size (and $c>0$ is a constant), the phase transition for the number of samples required to achieve vanishing compression redundancy is precisely $Θ(k^2)$.

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

↑