mlsanityData to 7 Oct 2026

InfoNCE is variational inference in a recognition parameterised model

arXiv 2107.02495 ↗First posted 6 Jul 2021stat.ML cs.LGcited by 10

Not on the map. Why?

Abstract (arXiv)

Here, we show that the InfoNCE objective is equivalent to the ELBO in a new class of probabilistic generative model, the recognition parameterised model (RPM). When we learn the optimal prior, the RPM ELBO becomes equal to the mutual information (MI; up to a constant), establishing a connection to pre-existing self-supervised learning methods such as InfoNCE. However, practical InfoNCE methods do not use the MI as an objective; the MI is invariant to arbitrary invertible transformations, so using an MI objective can lead to highly entangled representations (Tschannen et al., 2019). Instead, the actual InfoNCE objective is a simplified lower bound on the MI which is loose even in the infinite sample limit. Thus, an objective that works (i.e. the actual InfoNCE objective) appears to be motivated as a loose bound on an objective that does not work (i.e. the true MI which gives arbitrarily entangled representations). We give an alternative motivation for the actual InfoNCE objective. In particular, we show that in the infinite sample limit, and for a particular choice of prior, the actual InfoNCE objective is equal to the ELBO (up to a constant); and the ELBO is equal to the marginal likelihood with a deterministic recognition model. Thus, we argue that our VAE perspective gives a better motivation for InfoNCE than MI, as the actual InfoNCE objective is only loosely bounded by the MI, but is equal to the ELBO/marginal likelihood (up to a constant).

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 26 of its 49 references that are in the map. First posted on arXiv 6 Jul 2021.

Builds on

26 of 49 references.

References · 26

  1. 2020Denoising Diffusion Probabilistic Modelscited by 20,851
  2. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
  3. 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
  4. 2015Deep Unsupervised Learning using Nonequilibrium Thermodynamicscited by 7,005
  5. 2013Auto-Encoding Variational Bayescited by 3,980
  6. 2018Unsupervised Representation Learning by Predicting Image Rotationscited by 1,586
  7. 2020Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hyperspherecited by 1,393
  8. 2016Unsupervised Learning of Visual Representations by Solving Jigsaw Puzzlescited by 1,379
  9. 2021Variational Diffusion Modelscited by 1,145
  10. 2015Unsupervised Visual Representation Learning by Context Predictioncited by 1,062
  11. 2019An Introduction to Variational Autoencoderscited by 997
  12. 2018Challenging Common Assumptions in the Unsupervised Learning of Disentangled Representationscited by 929
14 more
  1. 2016InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Netscited by 858
  2. 2021Maximum Likelihood Training of Score-Based Diffusion Modelscited by 670
  3. 2018Disentangling by Factorisingcited by 614
  4. 2019On Variational Bounds of Mutual Informationcited by 550
  5. 2019Your Classifier is Secretly an Energy Based Model and You Should Treat it Like Onecited by 402
  6. 2018Understanding disentangling in β-VAEcited by 332
  7. 2019On Mutual Information Maximization for Representation Learningcited by 315
  8. 2021Self-Supervised Learning with Data Augmentations Provably Isolates Content from Stylecited by 308
  9. 2021Contrastive Learning Inverts the Data Generating Processcited by 220
  10. 2016Variational Lossy Autoencodercited by 175
  11. 2021Self-Supervised Learning with Kernel Dependence Maximizationcited by 77
  12. 2020SurVAE Flows: Surjections to Bridge the Gap between VAEs and Flowscited by 71
  13. 2020Capturing Label Characteristics in VAEscited by 30
  14. 2015Bayesian representation learning with oracle constraintscited by 16

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 4; 2025: 4; 2026: 2.

10 papers.