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

瓶颈高斯树的最小信息

Chernoff Information of Bottleneck Gaussian Trees

Binglin Li, Shuangqing Wei, Yue Wang, Jian Yuan

摘要:

本文的目的是找出判别一组高斯树时,确定高斯信息的决定因素。在这个集合中,每棵树可以通过从另一棵树的边缘移除和嫁接操作来获得。这相当于要求最可能混淆的高斯树(即“瓶颈”高斯树)之间的自适应信息,如最近ML估计的高斯树图中所示的情况。我们证明了通过边缘去除和嫁接操作相关的两个高斯树之间的Buckoff信息与两个三节点高斯树之间的Buckoff信息相同,其拓扑结构和边缘权重受到底层图操作的影响。此外,这样的dupff信息被证明是由两个高斯协方差矩阵的最大广义特征值。作为原始高斯向量的线性变换(LT)的结果的标量高斯变量的自相关信息也由相同的最大广义特征值唯一地确定。更有趣的是,在将测量成本并入归一化的Bffff信息之后,来自LT的高斯变量比基于原始高斯向量的高斯变量具有更大的归一化Bffff信息,如我们证明的界限所示

英文摘要:

In this paper, our objective is to find out the determining factors of Chernoff information in distinguishing a set of Gaussian trees. In this set, each tree can be attained via an edge removal and grafting operation from another tree. This is equivalent to asking for the Chernoff information between the most-likely confused, i.e. "bottleneck", Gaussian trees, as shown to be the case in ML estimated Gaussian tree graphs lately. We prove that the Chernoff information between two Gaussian trees related through an edge removal and a grafting operation is the same as that between two three-node Gaussian trees, whose topologies and edge weights are subject to the underlying graph operation. In addition, such Chernoff information is shown to be determined only by the maximum generalized eigenvalue of the two Gaussian covariance matrices. The Chernoff information of scalar Gaussian variables as a result of linear transformation (LT) of the original Gaussian vectors is also uniquely determined by the same maximum generalized eigenvalue. What is even more interesting is that after incorporating the cost of measurements into a normalized Chernoff information, Gaussian variables from LT have larger normalized Chernoff information than the one based on the original Gaussian vectors, as shown in our proved bounds

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

↑