HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Distributed Information Bottleneck Method for Discrete and Gaussian Sources

Abstract : We study the problem of distributed information bottleneck, in which multiple encoders separately compress their observations in a manner such that, collectively, the compressed signals preserve as much information as possible about another signal. The model generalizes Tishby's centralized information bottleneck method to the setting of multiple distributed encoders. We establish single-letter characterizations of the information-rate region of this problem for both i) a class of discrete memoryless sources and ii) memoryless vector Gaussian sources. Furthermore, assuming a sum constraint on rate or complexity, for both models we develop Blahut-Arimoto type iterative algorithms that allow to compute optimal information-rate trade-offs, by iterating over a set of self-consistent equations.
Document type :
Conference papers
Complete list of metadata

Contributor : Abdellatif Zaidi Connect in order to contact the contributor
Submitted on : Sunday, June 3, 2018 - 4:14:06 PM
Last modification on : Thursday, April 7, 2022 - 10:32:02 AM

Links full text


  • HAL Id : hal-01806552, version 1
  • ARXIV : 1709.09082


Inaki Estella Aguerri, Abdellatif Zaidi. Distributed Information Bottleneck Method for Discrete and Gaussian Sources. International Zurich Seminar on Information and Communication, Feb 2018, Zurich, Switzerland. ⟨hal-01806552⟩



Record views