{"title":"Reverse em-problem based on Bregman divergence and its application to classical and quantum information theory","authors":"Masahito Hayashi","doi":"arxiv-2403.09252","DOIUrl":null,"url":null,"abstract":"The recent paper (IEEE Trans. IT 69, 1680) introduced an analytical method\nfor calculating the channel capacity without the need for iteration. This\nmethod has certain limitations that restrict its applicability. Furthermore,\nthe paper does not provide an explanation as to why the channel capacity can be\nsolved analytically in this particular case. In order to broaden the scope of\nthis method and address its limitations, we turn our attention to the reverse\nem-problem, proposed by Toyota (Information Geometry, 3, 1355 (2020)). This\nreverse em-problem involves iteratively applying the inverse map of the em\niteration to calculate the channel capacity, which represents the maximum\nmutual information. However, several open problems remained unresolved in\nToyota's work. To overcome these challenges, we formulate the reverse\nem-problem based on Bregman divergence and provide solutions to these open\nproblems. Building upon these results, we transform the reverse em-problem into\nem-problems and derive a non-iterative formula for the reverse em-problem. This\nformula can be viewed as a generalization of the aforementioned analytical\ncalculation method. Importantly, this derivation sheds light on the information\ngeometrical structure underlying this special case. By effectively addressing\nthe limitations of the previous analytical method and providing a deeper\nunderstanding of the underlying information geometrical structure, our work\nsignificantly expands the applicability of the proposed method for calculating\nthe channel capacity without iteration.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"98 3 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2403.09252","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The recent paper (IEEE Trans. IT 69, 1680) introduced an analytical method
for calculating the channel capacity without the need for iteration. This
method has certain limitations that restrict its applicability. Furthermore,
the paper does not provide an explanation as to why the channel capacity can be
solved analytically in this particular case. In order to broaden the scope of
this method and address its limitations, we turn our attention to the reverse
em-problem, proposed by Toyota (Information Geometry, 3, 1355 (2020)). This
reverse em-problem involves iteratively applying the inverse map of the em
iteration to calculate the channel capacity, which represents the maximum
mutual information. However, several open problems remained unresolved in
Toyota's work. To overcome these challenges, we formulate the reverse
em-problem based on Bregman divergence and provide solutions to these open
problems. Building upon these results, we transform the reverse em-problem into
em-problems and derive a non-iterative formula for the reverse em-problem. This
formula can be viewed as a generalization of the aforementioned analytical
calculation method. Importantly, this derivation sheds light on the information
geometrical structure underlying this special case. By effectively addressing
the limitations of the previous analytical method and providing a deeper
understanding of the underlying information geometrical structure, our work
significantly expands the applicability of the proposed method for calculating
the channel capacity without iteration.
最近的一篇论文(IEEE Trans. IT 69, 1680)介绍了一种无需迭代即可计算信道容量的分析方法。这种方法有一定的局限性,限制了其适用性。此外,论文也没有解释为什么在这种特殊情况下可以用分析方法解决信道容量问题。为了扩大该方法的应用范围并解决其局限性,我们将注意力转向丰田提出的反向 em 问题(《信息几何》,3, 1355 (2020))。这个逆向 em 问题涉及迭代应用迭代的逆映射来计算信道容量,它代表了最大的互信息。然而,在丰田的工作中仍有几个未解决的问题。为了克服这些挑战,我们基于布雷格曼发散法提出了反向em问题,并提供了这些开放问题的解决方案。在这些结果的基础上,我们将反向 em 问题转化为 em 问题,并推导出反向 em 问题的非迭代公式。这个公式可以看作是上述分析计算方法的一般化。重要的是,这一推导揭示了这一特例背后的信息几何结构。通过有效解决前述分析方法的局限性,并提供对底层信息几何结构的更深入理解,我们的工作大大扩展了无迭代信道容量计算方法的适用性。