确定随机过程的熵率是一个基本的和困难的问题,封闭形式的解决方案,只有在特定的情况下。本文通过解决隐马尔可夫模型和Renyi熵的问题,推动了最新技术的发展。虽然马尔可夫链的问题简化为研究矩阵乘积的增长,但Hyndrome的计算涉及\emph{products of random matrices}。因此,这种情况要困难得多,到目前为止还没有明确的公式。我们展示了如何规避这个问题的整数阶的Renyi熵,减少问题再次到一个\emph{single matrix products}的矩阵形成的过渡和发射概率通过张量积。为了获得结果的渐近设置,我们使用一种新的技术来确定非负矩阵的权力的增长。经典的方法是Frobenius-Perron理论,但它需要正性假设;我们直接使用谱公式。因此,我们的结果不受限制,如不可约性和非周期性。这提高了我们对熵率的理解,即使是标准的(非隐藏的)马尔可夫链。最近发表的一个针对RSA的侧信道攻击被证明是有效的,使用我们的结果,专门为2阶。
英文摘要:
Determining entropy rates of stochastic processes is a fundamental and difficult problem, with closed-form solutions known only for specific cases. This paper pushes the state-of-the-art by solving the problem for Hidden Markov Models (HMMs) and Renyi entropies.
While the problem for Markov chains reduces to studying the growth of a matrix product, computations for HMMs involve \emph{products of random matrices}. As a result, this case is much harder and no explicit formulas have been known so far. We show how to circumvent this issue for Renyi entropy of integer orders, reducing the problem again to a \emph{single matrix products} where the matrix is formed from transition and emission probabilities by means of tensor product.
To obtain results in the asymptotic setting, we use a novel technique for determining the growth of non-negative matrix powers. The classical approach is the Frobenius-Perron theory, but it requires positivity assumptions; we instead work directly with the spectral formula. As a consequence, our results do not suffer from limitations such as irreducibility and aperiodicity. This improves our understanding of the entropy rate even for standard (unhidden) Markov chains.
A recently published side-channel attack against RSA was proven effective using our result, specialized to order 2.
Quantum Markov chains, sufficiency of quantum channels, and Renyi information measures
短量子马尔可夫链是三重态$ρ_{ABC}$,使得系统$A$可以通过作用于约化态$ρ_{BC}$的系统$C$而完全恢复。这些状态具有等于零的条件互信息$I(A;B|C)$,并且是具有该属性的唯一状态。如果存在一个恢复通道,使用该恢复通道可以从$\mathcal{N}(ρ)$完美地恢复$ρ$,从$\mathcal{N}(σ)$完美地恢复$σ$,则量子通道$\mathcal{N}$对于两个状态$ρ$和$σ$是足够的。相对熵差$D(ρ\Vertσ)-D(\mathcal{N}(ρ)\Vert\mathcal{N}(σ))$等于零当且仅当$\mathcal{N}$对于$ρ$和$σ$是足够的。在本文中,我们证明了这些性质扩展到这些信息测度的Renyi推广[Berta et al.,J.Math.Phys.56,022205,(2015)]和[Seshadreesan等人,J. Phys. A 48,395303,(2015)],从而提供了短量子马尔可夫链和足够的量子信道的替代表征。这些结果进一步支持这些数量是合法的Renyi推广的条件互信息和相对熵差。一路上,我们解决了一些开放的问题Ruskai和张,关于跟踪特定的矩阵中出现的单调性的量子操作下的相对熵和强次加性的冯诺依曼熵的研究。
Context Tree Estimation in Variable Length Hidden Markov Models
我们解决了可变长度隐马尔可夫模型中的上下文树估计问题。我们提出了一个估计的上下文树的隐马尔可夫过程,它不需要事先上界的深度上下文树。我们证明了估计量是强相合的。这一方法使用了Finesso和Lorenzo(Consistent estimation of the order for Markov and hidden Markov chains(1990))和E.Gassiat和S.Boucheron(Optimal error exponents in hidden Markov model order estimation(2003))的信息论混合不等式。我们提出了一种算法来有效地计算估计,并提供模拟研究,以支持我们的结果。