mlsanityData to 14 Oct 2026

AdaDim: Dimensionality Adaptation for SSL Representational Dynamics

arXiv 2505.12576 ↗First posted 18 May 2025cs.LG cs.AIcited by 4

Not on the map. Why?

Abstract (arXiv)

A key factor in effective Self-Supervised learning (SSL) is preventing dimensional collapse, where higher-dimensional representation spaces (R) span a lower-dimensional subspace. Therefore, SSL optimization strategies involve guiding a model to produce R with a higher dimensionality (H(R)) through objectives that encourage decorrelation of features or sample uniformity in R. A higher H(R) indicates that R has greater feature diversity which is useful for generalization to downstream tasks. Alongside dimensionality optimization, SSL algorithms also utilize a projection head that maps R into an embedding space Z. Recent work has characterized the projection head as a filter of noisy or irrelevant features from the SSL objective by reducing the mutual information I(R;Z). Therefore, the current literature's view is that a good SSL representation space should have a high H(R) and a low I(R;Z). However, this view of SSL is lacking in terms of an understanding of the underlying training dynamics that influences the relationship between both terms. Our analysis shows that the best performing SSL models do not have the highest H(R) nor the lowest I(R;Z), but effectively arrive at a balance between both. To take advantage of this analysis, we introduce AdaDim, a training strategy that leverages SSL training dynamics by adaptively balancing between increasing H(R) through feature decorrelation and sample uniformity as well as gradual regularization of I(R;Z) as training progresses. We show performance improvements of up to 3% over common SSL baselines despite our method not utilizing expensive techniques such as queues, clustering, predictor networks, or student-teacher architectures.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 43 of its 56 references that are in the map. First posted on arXiv 18 May 2025.

Builds on

43 of 56 references.

References · 43

  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. 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,968
  5. 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,750
  6. 2020Exploring Simple Siamese Representation Learningcited by 2,866
  7. 2020Unsupervised Learning of Visual Features by Contrasting Cluster Assignmentscited by 2,857
  8. 2020Supervised Contrastive Learningcited by 2,829
  9. 2020Improved Baselines with Momentum Contrastive Learningcited by 2,287
  10. 2021Barlow Twins: Self-Supervised Learning via Redundancy Reductioncited by 1,838
  11. 2021An Empirical Study of Training Self-Supervised Vision Transformerscited by 1,616
  12. 2020Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hyperspherecited by 1,405
31 more
  1. 2018Learning deep representations by mutual information estimation and maximizationcited by 1,273
  2. 2021VICReg: Variance-Invariance-Covariance Regularization for Self-Supervised Learningcited by 1,057
  3. 2018Deep Clustering for Unsupervised Learning of Visual Featurescited by 1,028
  4. 2020What Makes for Good Views for Contrastive Learning?cited by 846
  5. 2021MedMNIST v2 -- A large-scale lightweight benchmark for 2D and 3D biomedical image classificationcited by 690
  6. 2019A Theoretical Analysis of Contrastive Unsupervised Representation Learningcited by 530
  7. 2021Understanding Dimensional Collapse in Contrastive Self-supervised Learningcited by 378
  8. 2021With a Little Help from My Friends: Nearest-Neighbor Contrastive Learning of Visual Representationscited by 326
  9. 2020Whitening for Self-Supervised Representation Learningcited by 279
  10. 2021Understanding self-supervised Learning Dynamics without Contrastive Pairscited by 256
  11. 2020Learning Robust Representations via Multi-View Information Bottleneckcited by 191
  12. 2022RankMe: Assessing the downstream performance of pretrained self-supervised representations by their rankcited by 153
  13. 2021Solo-learn: A Library of Self-supervised Methods for Visual Representation Learningcited by 116
  14. 2022On the duality between contrastive and non-contrastive self-supervised learningcited by 108
  15. 2021ReSSL: Relational Self-Supervised Learning with Weak Augmentationcited by 84
  16. 2017Critical Learning Periods in Deep Neural Networkscited by 79
  17. 2023On the Stepwise Nature of Self-Supervised Learningcited by 36
  18. 2023Towards a Unified Theoretical Understanding of Non-contrastive Learning via Rank Differential Mechanismcited by 33
  19. 2023LiDAR: Sensing Linear Probing Performance in Joint Embedding SSL Architecturescited by 27
  20. 2023Matrix Information Theory for Self-Supervised Learningcited by 21
  21. 2023VNE: An Effective Method for Improving Deep Representation by Manipulating Eigenvalue Distributioncited by 17
  22. 2022Implicit variance regularization in non-contrastive SSLcited by 16
  23. 2023Information Flow in Self-Supervised Learningcited by 16
  24. 2022Volumetric Supervised Contrastive Learning for Seismic Semantic Segmentationcited by 12
  25. 2025Projection Head is Secretly an Information Bottleneckcited by 11
  26. 2023Clinically Labeled Contrastive Learning for OCT Biomarker Classificationcited by 9
  27. 2024HEX: Hierarchical Emergence Exploitation in Self-Supervised Algorithmscited by 7
  28. 2023Exploiting the Distortion-Semantic Interaction in Fisheye Datacited by 6
  29. 2023Representation Learning Dynamics of Self-Supervised Modelscited by 3
  30. 2024Taxes Are All You Need: Integration of Taxonomical Hierarchy Relationships into the Contrastive Losscited by 3
  31. 2023Understanding and Leveraging the Learning Phases of Neural Networkscited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 3.

4 papers.