New Algorithms for Computing Sibson Capacity and Arimoto Capacity
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911873700462592 |
|---|---|
| author | Kamatsuka, Akira Ishikawa, Yuki Kazama, Koki Yoshida, Takahiro |
| author_facet | Kamatsuka, Akira Ishikawa, Yuki Kazama, Koki Yoshida, Takahiro |
| contents | The Sibson and Arimoto capacity, which are based on the Sibson and Arimoto mutual information (MI) of order α, 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_14241 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | New Algorithms for Computing Sibson Capacity and Arimoto Capacity Kamatsuka, Akira Ishikawa, Yuki Kazama, Koki Yoshida, Takahiro Information Theory The Sibson and Arimoto capacity, which are based on the Sibson and Arimoto mutual information (MI) of order α, 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. |
| title | New Algorithms for Computing Sibson Capacity and Arimoto Capacity |
| topic | Information Theory |
| url | https://arxiv.org/abs/2401.14241 |