Pith. sign in

REVIEW 1 cited by

Multivariate Information Bottleneck

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1301.2270 v1 pith:KW4F7OA6 submitted 2013-01-10 cs.LG cs.AIstat.ML

classification cs.LGcs.AIstat.ML
keywords bottleneckinformationmethodclustersdataframeworkgeneralmultivariate
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Accurate Estimation of Mutual Information in High Dimensional Data

    physics.data-an 2025-05 conditional novelty 5.0 of 10

    Neural MI estimators can become reliable in low-latent-dimension settings with a protocol of max-test early stopping, subsampling extrapolation, and probabilistic critics.

Pith tools