Distributed information-theoretic biclustering

Pichler Georg (1) , Pablo Piantanida (2) , Gerald Matz (3)

1 TU Wien - Vienna University of Technology = Technische Universität Wien
2 L2S - Laboratoire des signaux et systèmes
3 Institute for Telecommunications, Vienna University of Technology (Vienna University)

We study a novel multi-terminal source coding setup motivated by the biclustering problem. Two separate encoders observe two stationary, memoryless sources Xn and Zn, respectively. The goal is to find rate-limited encodings f(xn) and g(zn) that maximize the mutual information I(f(Xn);g(Zn))/n. We present non-trivial outer and inner bounds on the achievable region for this problem. These bounds are also generalized to an arbitrary collection of stationary, memoryless sources. The considered problem is intimately connected to distributed hypothesis testing against independence under communication constraints, and hence our results are expected to apply to that setting as well.

Domaines: Théorie de l'information [cs.IT]; Théorie de l'information et codage [math.IT]; Statistiques [math.ST]

Pichler Georg, Pablo Piantanida, Gerald Matz. Distributed information-theoretic biclustering. 2016. ⟨hal-01436774⟩