arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1810.01969cs.ITcs.CCmath.ITmath.PR
收藏

隐马尔可夫模型的极化

Algorithmic Polarization for Hidden Markov Models

Venkatesan Guruswami, Preetum Nakkiran, Madhu Sudan

摘要:

使用极化码的温和变体,我们设计了压缩隐马尔可夫源的线性压缩方案(其中源是马尔可夫链,但其状态不一定可以从其输出中观察到),并从隐马尔可夫信道解码(其中信道具有状态并且引入的错误取决于状态)。我们给出了第一个多项式时间算法,该算法能够在马尔可夫链的容量间隙和混合时间中以多项式$\it{both}$的输入长度进行压缩和解码(或编码和解码)。先前的工作实现容量仅在大长度的限制下渐近,并且多项式界限对于容量间隙或混合时间不可用。我们的结果在源(或通道)为$\it{known}$的设置中运行。如果源是$\it{unknown}$,那么在如此短的长度压缩将导致有效的算法与噪声学习奇偶校验-因此,我们的结果是第一个建议分离的复杂性的问题时,源是已知的,当它是未知的。

英文摘要:

Using a mild variant of polar codes we design linear compression schemes compressing Hidden Markov sources (where the source is a Markov chain, but whose state is not necessarily observable from its output), and to decode from Hidden Markov channels (where the channel has a state and the error introduced depends on the state). We give the first polynomial time algorithms that manage to compress and decompress (or encode and decode) at input lengths that are polynomial $\it{both}$ in the gap to capacity and the mixing time of the Markov chain. Prior work achieved capacity only asymptotically in the limit of large lengths, and polynomial bounds were not available with respect to either the gap to capacity or mixing time. Our results operate in the setting where the source (or the channel) is $\it{known}$. If the source is $\it{unknown}$ then compression at such short lengths would lead to effective algorithms for learning parity with noise -- thus our results are the first to suggest a separation between the complexity of the problem when the source is known versus when it is unknown.

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

↑