Saved in:
Bibliographic Details
Main Authors: Kamatsuka, Akira, Yoshida, Takahiro
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2602.18405
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866908844460867584
author Kamatsuka, Akira
Yoshida, Takahiro
author_facet Kamatsuka, Akira
Yoshida, Takahiro
contents The information bottleneck (IB) method seeks a compressed representation of data that preserves information relevant to a target variable for prediction while discarding irrelevant information from the original data. In its classical formulation, the IB method employs mutual information to evaluate the compression between the original and compressed data and the utility of the representation for the target variable. In this study, we investigate a generalized IB problem, where the evaluation of utility is based on the $\mathcal{H}$-mutual information that satisfies the concave (\texttt{CV}) and averaging (\texttt{AVG}) conditions. This class of information measures admits a statistical decision-theoretic interpretation via its equivalence to the expected value of sample information. Based on this interpretation, we derive an alternating optimization algorithm to assess the tradeoff between compression and utility in the generalized IB problem.
format Preprint
id arxiv_https___arxiv_org_abs_2602_18405
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle A Generalized Information Bottleneck Method: A Decision-Theoretic Perspective
Kamatsuka, Akira
Yoshida, Takahiro
Information Theory
The information bottleneck (IB) method seeks a compressed representation of data that preserves information relevant to a target variable for prediction while discarding irrelevant information from the original data. In its classical formulation, the IB method employs mutual information to evaluate the compression between the original and compressed data and the utility of the representation for the target variable. In this study, we investigate a generalized IB problem, where the evaluation of utility is based on the $\mathcal{H}$-mutual information that satisfies the concave (\texttt{CV}) and averaging (\texttt{AVG}) conditions. This class of information measures admits a statistical decision-theoretic interpretation via its equivalence to the expected value of sample information. Based on this interpretation, we derive an alternating optimization algorithm to assess the tradeoff between compression and utility in the generalized IB problem.
title A Generalized Information Bottleneck Method: A Decision-Theoretic Perspective
topic Information Theory
url https://arxiv.org/abs/2602.18405