What Do We Maximize in Self-Supervised Learning?

Ravid Shwartz-Ziv, Randall Balestriero, Yann LeCun
7/20/2022
cs.LGcs.AI

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

In this paper, we examine self-supervised learning methods, particularly VICReg, to provide an information-theoretical understanding of their construction. As a first step, we demonstrate how information-theoretic quantities can be obtained for a deterministic network, offering a possible alternative to prior work that relies on stochastic models. This enables us to demonstrate how VICReg can be (re)discovered from first principles and its assumptions about data distribution. Furthermore, we empirically demonstrate the validity of our assumptions, confirming our novel understanding of VICReg. Finally, we believe that the derivation and insights we obtain can be generalized to many other SSL methods, opening new avenues for theoretical and practical understanding of SSL and transfer learning.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{shwartzziv2022what,
  title  = {What Do We Maximize in Self-Supervised Learning?},
  author = {Ravid Shwartz-Ziv and Randall Balestriero and Yann LeCun},
  year   = {2022},
  eprint = {2207.10081},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2207.10081v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2207.10081.svg)](https://codeofpaper.com/paper/2207.10081)

Discussion