Contrastive Predictive Coding Done Right for Mutual Information Estimation
Not on the map. Why?
Abstract (arXiv)
The InfoNCE objective, originally introduced for contrastive representation learning, has become a popular choice for mutual information (MI) estimation, despite its indirect connection to MI. In this paper, we demonstrate why InfoNCE should not be regarded as a valid MI estimator, and we introduce a simple modification, which we refer to as InfoNCE-anchor, for accurate MI estimation. Our modification introduces an auxiliary anchor class, enabling consistent density ratio estimation and yielding a plug-in MI estimator with significantly reduced bias. Beyond this, we generalize our framework using proper scoring rules, which recover InfoNCE-anchor as a special case when the log score is employed. This formulation unifies a broad spectrum of contrastive objectives, including NCE, InfoNCE, and f-divergence variants, under a single principled framework. Empirically, we find that InfoNCE-anchor with the log score achieves the most accurate MI estimates; however, in self-supervised representation learning experiments, we find that the anchor does not improve the downstream task performance. These findings corroborate that contrastive representation learning benefits not from accurate MI estimation per se, but from the learning of structured density ratios.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 28 of its 44 references that are in the map. First posted on arXiv 29 Oct 2025.
Builds on
28 of 44 references.
References · 28
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
- 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,375
- 2020Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hyperspherecited by 1,405
- 2018Learning deep representations by mutual information estimation and maximizationcited by 1,273
- 2019Learning Representations by Maximizing Mutual Information Across Viewscited by 734
- 2018MINE: Mutual Information Neural Estimationcited by 683
- 2019On Variational Bounds of Mutual Informationcited by 559
- 2020A Survey on Contrastive Self-supervised Learningcited by 554
- 2019On Mutual Information Maximization for Representation Learningcited by 316
- 2021Provable Guarantees for Self-Supervised Deep Learning with Spectral Contrastive Losscited by 313
- 2018Formal Limitations on the Measurement of Mutual Informationcited by 189
16 more
- 2019Understanding the Limitations of Variational Mutual Information Estimatorscited by 140
- 2021Solo-learn: A Library of Self-supervised Methods for Visual Representation Learningcited by 116
- 2018Noise Contrastive Estimation and Negative Sampling for Conditional Models: Consistency and Statistical Efficiencycited by 105
- 2020On Mutual Information in Contrastive Learning for Visual Representationscited by 54
- 2020Multi-label Contrastive Predictive Codingcited by 32
- 2020Neural Methods for Point-wise Dependency Estimationcited by 22
- 2018An Efficient Approach to Informative Feature Extraction from Multimodal Datacited by 21
- 2024Approximating mutual information of high-dimensional variables using learned representationscited by 21
- 2023Mutual Information Estimation via f-Divergence and Data Derangementscited by 17
- 2024Operator SVD with Neural Networks via Nested Low-Rank Approximationcited by 13
- 2024f-MICL: Understanding and Generalizing InfoNCE-based Contrastive Learningcited by 13
- 2024A Benchmark Suite for Evaluating Neural Mutual Information Estimators on Unstructured Datasetscited by 10
- 2022RenyiCL: Contrastive Representation Learning with Skew Renyi Divergencecited by 8
- 2023Unconstrained Stochastic CCA: Unifying Multiview and Self-Supervised Learningcited by 7
- 2021A Unified Framework for Multi-distribution Density Ratio Estimationcited by 5
- 2024A Unified View on Learning Unnormalized Distributions via Noise-Contrastive Estimationcited by 2
Built on by
Citing papers per year: 2026: 2.
2 papers.