Distributed information-theoretic clustering - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Information and Inference Année : 2022

Distributed information-theoretic clustering

Résumé

Abstract We study a novel multi-terminal source coding setup motivated by the biclustering problem. Two separate encoders observe two i.i.d. sequences $X^n$ and $Y^n$, respectively. The goal is to find rate-limited encodings $f(x^n)$ and $g(z^n)$ that maximize the mutual information $\textrm{I}(\,{f(X^n)};{g(Y^n)})/n$. We discuss connections of this problem with hypothesis testing against independence, pattern recognition and the information bottleneck method. Improving previous cardinality bounds for the inner and outer bounds allows us to thoroughly study the special case of a binary symmetric source and to quantify the gap between the inner and the outer bound in this special case. Furthermore, we investigate a multiple description (MD) extension of the CEO problem with mutual information constraint. Surprisingly, this MD-CEO problem permits a tight single-letter characterization of the achievable region.
Fichier principal
Vignette du fichier
Distributed information-theoretic clustering.pdf (808.72 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04137003 , version 1 (22-06-2023)

Identifiants

Citer

Georg Pichler, Pablo Piantanida, Gerald Matz. Distributed information-theoretic clustering. Information and Inference, 2022, 11 (1), pp.137-166. ⟨10.1093/imaiai/iaab007⟩. ⟨hal-04137003⟩
9 Consultations
6 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More