mlsanityData to 14 Oct 2026

Feature Normalization Prevents Collapse of Non-contrastive Learning Dynamics

arXiv 2309.16109 ↗First posted 28 Sep 2023cs.LG stat.MLcited by 2

Not on the map. Why?

Abstract (arXiv)

Contrastive learning is a self-supervised representation learning framework, where two positive views generated through data augmentation are made similar by an attraction force in a data representation space, while a repulsive force makes them far from negative examples. Non-contrastive learning, represented by BYOL and SimSiam, further gets rid of negative examples and improves computational efficiency. While learned representations may collapse into a single point due to the lack of the repulsive force at first sight, Tian et al. (2021) revealed through the learning dynamics analysis that the representations can avoid collapse if data augmentation is sufficiently stronger than regularization. However, their analysis does not take into account commonly-used feature normalization, a normalizer before measuring the similarity of representations, and hence excessively strong regularization may collapse the dynamics, which is an unnatural behavior under the presence of feature normalization. Therefore, we extend the previous theory based on the L2 loss by considering the cosine loss, which involves feature normalization. We show that the cosine loss induces sixth-order dynamics (while the L2 loss induces a third-order one), in which a stable equilibrium dynamically emerges even if there are only collapsed solutions with given initial parameters. Thus, we offer a new understanding that feature normalization plays an important role in robustly preventing the dynamics collapse.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 47 of its 60 references that are in the map. First posted on arXiv 28 Sep 2023.

Builds on

47 of 60 references.

References · 47

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
  3. 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
  4. 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,403
  5. 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,968
  6. 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,750
  7. 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,611
  8. 2020Exploring Simple Siamese Representation Learningcited by 2,866
  9. 2020Unsupervised Learning of Visual Features by Contrasting Cluster Assignmentscited by 2,857
  10. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
  11. 2021Barlow Twins: Self-Supervised Learning via Redundancy Reductioncited by 1,838
  12. 2020Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hyperspherecited by 1,405
35 more
  1. 2021VICReg: Variance-Invariance-Covariance Regularization for Self-Supervised Learningcited by 1,057
  2. 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 763
  3. 2019On Variational Bounds of Mutual Informationcited by 559
  4. 2019A Theoretical Analysis of Contrastive Unsupervised Representation Learningcited by 530
  5. 2020Whitening for Self-Supervised Representation Learningcited by 279
  6. 2021Understanding self-supervised Learning Dynamics without Contrastive Pairscited by 256
  7. 2022Contrastive and Non-Contrastive Self-Supervised Learning Recover Global and Local Spectral Embedding Methodscited by 149
  8. 2019Understanding the Limitations of Variational Mutual Information Estimatorscited by 140
  9. 2017L2 Regularization versus Batch and Weight Normalizationcited by 124
  10. 2019Implicit Regularization of Discrete Gradient Dynamics in Linear Neural Networkscited by 124
  11. 2021Toward Understanding the Feature Learning Process of Self-supervised Contrastive Learningcited by 119
  12. 2022Chaos is a Ladder: A New Theoretical Understanding of Contrastive Learning via Augmentation Overlapcited by 105
  13. 2022Same Pre-training Loss, Better Downstream: Implicit Bias Matters for Language Modelscited by 84
  14. 2022Pushing the limits of self-supervised ResNets: Can we outperform supervised learning without labels on ImageNet?cited by 67
  15. 2022How Does SimSiam Avoid Collapse Without Negative Samples? A Unified Understanding with Self-supervised Contrastive Learningcited by 65
  16. 2021Understanding Negative Samples in Instance Discriminative Self-supervised Representation Learningcited by 47
  17. 2022Neural Manifold Clustering and Embeddingcited by 44
  18. 2022Understanding Self-Predictive Learning for Reinforcement Learningcited by 44
  19. 2022Understanding Collapse in Non-Contrastive Siamese Representation Learningcited by 42
  20. 2022On the Importance of Asymmetry for Siamese Representation Learningcited by 39
  21. 2022Do More Negative Samples Necessarily Hurt in Contrastive Learning?cited by 39
  22. 2022The Mechanism of Prediction Head in Non-contrastive Self-supervised Learningcited by 38
  23. 2018Classification from Pairwise Similarity and Unlabeled Datacited by 36
  24. 2019Bootstrapping Upper Confidence Boundcited by 36
  25. 2022Improving Self-Supervised Learning by Characterizing Idealized Representationscited by 34
  26. 2023Towards a Unified Theoretical Understanding of Non-contrastive Learning via Rank Differential Mechanismcited by 33
  27. 2021On the Surrogate Gap between Contrastive and Supervised Lossescited by 25
  28. 2022Contrasting the landscape of contrastive and non-contrastive learningcited by 24
  29. 2021Towards Demystifying Representation Learning with Non-contrastive Self-supervisioncited by 23
  30. 2022What shapes the loss landscape of self-supervised learning?cited by 19
  31. 2022Implicit variance regularization in non-contrastive SSLcited by 16
  32. 2020Optimization Theory for ReLU Neural Networks Trained with Normalization Layerscited by 15
  33. 2023The Edge of Orthogonality: A Simple View of What Makes BYOL Tickcited by 15
  34. 2023On the impact of activation and normalization in obtaining isometric embeddings at initializationcited by 13
  35. 2020Pairwise Supervision Can Provably Elicit a Decision Boundarycited by 9

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 0; 2026: 1.

2 papers.