Title
The Double-Sided Information-Bottleneck Function
Abstract
We consider a two-terminal variant (double-sided) of the information bottleneck problem, which is related to biclus-tering. In our setup, X and Y are dependent random variables and the problem is to find two independent channels P-U vertical bar X and P-V vertical bar Y (setting the Markovian structure U -> X -> Y -> V) that maximize I(U; V) subject to constraints on the relevant mutual information expressions: I(U; X) and I(V; Y). For jointly Gaussian X and Y, we show that Gaussian channels are optimal in the low-SNR regime, but not for general SNR. Similarly, it is shown that for a doubly symmetric binary source, binary symmetric channels are optimal when the correlation is low, and are suboptimal for high correlation. We conjecture that Z and S channels are optimal when the correlation is 1 (i.e., X = Y), and provide supporting numerical evidence.
Year
DOI
Venue
2021
10.1109/ISIT45174.2021.9517899
2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)
DocType
Citations 
PageRank 
Conference
0
0.34
References 
Authors
0
3
Name
Order
Citations
PageRank
Michael Dikshtein100.34
Or Ordentlich201.69
Shlomo Shamai34531410.89