New Algorithms for Computing Sibson Capacity and Arimoto Capacity
Information Theory
2024-05-14 v4 math.IT
Abstract
The Sibson and Arimoto capacity, which are based on the Sibson and Arimoto mutual information (MI) of order {\alpha}, respectively, are well-known generalizations of the channel capacity C. In this study, we derive novel alternating optimization algorithms for computing these capacities by providing new variational characterizations of the Sibson and Arimoto MI. Moreover, we prove that all iterative algorithms for computing these capacities are equivalent under appropriate conditions imposed on their initial distributions.
Cite
@article{arxiv.2401.14241,
title = {New Algorithms for Computing Sibson Capacity and Arimoto Capacity},
author = {Akira Kamatsuka and Yuki Ishikawa and Koki Kazama and Takahiro Yoshida},
journal= {arXiv preprint arXiv:2401.14241},
year = {2024}
}