WERank: Towards Rank Degradation Prevention for Self-Supervised Learning Using Weight Regularization
Not on the map. Why?
Abstract (arXiv)
A common phenomena confining the representation quality in Self-Supervised Learning (SSL) is dimensional collapse (also known as rank degeneration), where the learned representations are mapped to a low dimensional subspace of the representation space. The State-of-the-Art SSL methods have shown to suffer from dimensional collapse and fall behind maintaining full rank. Recent approaches to prevent this problem have proposed using contrastive losses, regularization techniques, or architectural tricks. We propose WERank, a new regularizer on the weight parameters of the network to prevent rank degeneration at different layers of the network. We provide empirical evidence and mathematical justification to demonstrate the effectiveness of the proposed regularization method in preventing dimensional collapse. We verify the impact of WERank on graph SSL where dimensional collapse is more pronounced due to the lack of proper data augmentation. We empirically demonstrate that WERank is effective in helping BYOL to achieve higher rank during SSL pre-training and consequently downstream accuracy during evaluation probing. Ablation studies and experimental analysis shed lights on the underlying factors behind the performance gains of the proposed approach.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 29 of its 35 references that are in the map. First posted on arXiv 14 Feb 2024.
Builds on
29 of 35 references.
References · 29
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
- 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,346
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
- 2020Exploring Simple Siamese Representation Learningcited by 2,853
- 2020Unsupervised Learning of Visual Features by Contrasting Cluster Assignmentscited by 2,845
- 2021Barlow Twins: Self-Supervised Learning via Redundancy Reductioncited by 1,818
- 2021VICReg: Variance-Invariance-Covariance Regularization for Self-Supervised Learningcited by 1,013
- 2019Learning Representations by Maximizing Mutual Information Across Viewscited by 733
17 more
- 2015Image-based Recommendations on Styles and Substitutescited by 702
- 2020Deep Graph Contrastive Representation Learningcited by 535
- 2019Implicit Regularization in Deep Matrix Factorizationcited by 402
- 2021Understanding Dimensional Collapse in Contrastive Self-supervised Learningcited by 374
- 2017Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Rankingcited by 332
- 2023A critical look at the evaluation of GNNs under heterophily: Are we really making progress?cited by 332
- 2018Learning Word Vectors for 157 Languagescited by 279
- 2020Whitening for Self-Supervised Representation Learningcited by 278
- 2021Large-Scale Representation Learning on Graphs via Bootstrappingcited by 184
- 2021On Feature Decorrelation in Self-Supervised Learningcited by 160
- 2022Contrastive and Non-Contrastive Self-Supervised Learning Recover Global and Local Spectral Embedding Methodscited by 146
- 2022RankMe: Assessing the downstream performance of pretrained self-supervised representations by their rankcited by 145
- 2017Predicting multicellular function through multi-layer tissue networkscited by 138
- 2021Augmentation-Free Self-Supervised Learning on Graphscited by 94
- 2021Graph Barlow Twins: A self-supervised representation learning framework for graphscited by 85
- 2019Unsupervised Deep Learning by Neighbourhood Discoverycited by 78
- 2022Single-Pass Contrastive Learning Can Work for Both Homophilic and Heterophilic Graphcited by 14
Built on by
Citing papers per year: 2024: 2; 2025: 0; 2026: 1.
3 papers.
- 2024How JEPA Avoids Noisy Features: The Implicit Bias of Deep Linear Self Distillation Networkscited by 29
- 2024Preventing Dimensional Collapse in Self-Supervised Learning via Orthogonality Regularizationcited by 9
- 2026On the Role of the Projector in Contrastive Self-Supervised Learning: Last-Layer Rank Dynamics Drive Representation Qualitycited by 0
- 2026On the Role of the Projector in Contrastive Self-Supervised Learning: Last-Layer Rank Dynamics Drive Representation Quality22 Sep 2026
- 2024Preventing Dimensional Collapse in Self-Supervised Learning via Orthogonality Regularization1 Nov 2024
- 2024How JEPA Avoids Noisy Features: The Implicit Bias of Deep Linear Self Distillation Networks3 Jul 2024