A Minimal Model of Representation Collapse: Frustration, Stop-Gradient, and Dynamics
Louie Hong Yao, Yuhao Li, Shengchao Liu

TL;DR
This paper introduces a minimal model to analyze representation collapse in self-supervised learning, showing how frustration and stop-gradient influence the dynamics and stability of embeddings.
Contribution
It provides a theoretical framework with closed-form analysis of collapse mechanisms and demonstrates how stop-gradient prevents collapse, validated by empirical models.
Findings
Collapse occurs when data are not perfectly classifiable.
Stop-gradient stabilizes non-collapsed solutions.
Frustrated samples induce collapse through slow dynamics.
Abstract
Self-supervised representation learning is central to modern machine learning because it extracts structured latent features from unlabeled data and enables robust transfer across tasks and domains. However, it can suffer from representation collapse, a widely observed failure mode in which embeddings lose discriminative structure and distinct inputs become indistinguishable. To understand the mechanisms that drive collapse and the ingredients that prevent it, we introduce a minimal embedding-only model whose gradient-flow dynamics and fixed points can be analyzed in closed form, using a classification-representation setting as a concrete playground where collapse is directly quantified through the contraction of label-embedding geometry. We illustrate that the model does not collapse when the data are perfectly classifiable, while a small fraction of frustrated samples that cannot be…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
