The two-way cooperative information bottleneck

Abstract : The two-way Information Bottleneck problem, where two nodes exchange information iteratively about two arbitrarily dependent memoryless sources, is considered. Based on the observations and the information exchange, each node is required to extract “relevant information”, measured in terms of the normalized mutual information, from two arbitrarily dependent hidden sources. The optimal trade-off between rates of relevance and complexity, and the number of exchange rounds, is obtained through a single-letter characterization. We further extend the results to the Gaussian case. Applications of our setup arise in the development of collaborative clustering algorithms.
Complete list of metadatas
Contributor : Pablo Piantanida <>
Submitted on : Sunday, January 17, 2016 - 10:48:54 PM
Last modification on : Thursday, April 26, 2018 - 4:11:36 PM



Vera Matias, Leonardo Rey Vega, Pablo Piantanida. The two-way cooperative information bottleneck. IEEE International Symposium on Information Theory - (ISIT 2015), Jun 2015, Hong Kong, Hong Kong SAR China. ⟨10.1109/ISIT.2015.7282832⟩. ⟨hal-01257614⟩



Record views