A Variational Characterization of <i>H</i>-Mutual Information and Its Application to Computing <i>H</i>-Capacity

H-mutual information (H-MI) is a wide class of information leakage measures, where H = (η, F) is a pair of monotonically increasing function η and a concave function F, which is a generalization of Shannon entropy. H-MI is defined as the difference between the generalized entropy H and its conditional version, including Shannon mutual information (MI), Arimoto MI of order α, g-leakage, and expected value of sample information. This study presents a variational characterization of H-MI via statistical decision theory. Based on the characterization, we propose an alternating optimization algorithm for computing H-capacity.

Authors

Institutions

Publication Details

Journal
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
Published
2024-08-15
DOI
https://doi.org/10.1587/transfun.2024tap0010
Citations
1
Primary Topic
Computability, Logic, AI Algorithms
Type
article
Field-Weighted Citation Impact
0.36

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Variational Characterization of H-Mutual Information and Its Application to Computing H-Capacity

Akira Kamatsuka, Koki Kazama, Takahiro Yoshida
1 citations
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
Computability, Logic, AI Algorithms
0.36
article

A Variational Characterization of H-Mutual Information and Its Application to Computing H-Capacity

Akira Kamatsuka, Koki Kazama, Takahiro Yoshida
article en
1 citations

Abstract

H-mutual information (H-MI) is a wide class of information leakage measures, where H = (η, F) is a pair of monotonically increasing function η and a concave function F, which is a generalization of Shannon entropy. H-MI is defined as the difference between the generalized entropy H and its conditional version, including Shannon mutual information (MI), Arimoto MI of order α, g-leakage, and expected value of sample information. This study presents a variational characterization of H-MI via statistical decision theory. Based on the characterization, we propose an alternating optimization algorithm for computing H-capacity.

IEICE Transactions on Fundamentals of Electronics Communications and Computer SciencesVol. E108.A(3)
Nihon University (JP), Shonan Institute of Technology (JP)
Japan Society for the Promotion of Science
Industry, innovation and infrastructure
Openalex Percentile: Top 37%
Computability, Logic, AI Algorithms
0.36
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A Variational Characterization of <i>H</i>-Mutual Information and Its Application to Computing <i>H</i>-Capacity — Akira Kamatsuka, Koki Kazama, et al. · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences (2024) | TGRS Research Map | TGRS