Multivariate Information Bottleneck

Abstract

The Information bottleneck method is an unsupervised non-parametric data organization technique. Given a joint distribution P(A,B), this method constructs a new variable T that extracts partitions, or clusters, over the values of A that are informative about B. The information bottleneck has already been applied to document classification, gene expression, neural code, and spectral analysis. In this paper, we introduce a general principled framework for multivariate extensions of the information bottleneck method. This allows us to consider multiple systems of data partitions that are inter-related. Our approach utilizes Bayesian networks for specifying the systems of clusters and what information each captures. We show that this construction provides insight about bottleneck variations and enables us to characterize solutions of these variations. We also present a general framework for iterative algorithms for constructing solutions, and apply it to several examples.

Appears in Proceedings of the Seventeenth Conference on Uncertainty in Artificial Intelligence (UAI2001)

Cited by in corpus (8)

• The Information Bottleneck EM Algorithm
• Maximally Informative Hierarchical Representations of High-Dimensional Data
• Information Bottleneck and its Applications in Deep Learning
• Probabilistic analysis of the human transcriptome with side information
• Gaussian Lower Bound for the Information Bottleneck Limit
• The color of smiling: computational synaesthesia of facial expressions
• Specializing Word Embeddings (for Parsing) by Information Bottleneck
• On the Relevance-Complexity Region of Scalable Information Bottleneck