AdaDim: Dimensionality Adaptation for SSL Representational Dynamics
cs.LG, cs.AI
Submitted: 2025-05-18
Updated: 2026-09-23
Comments: Under Review
License: http://creativecommons.org/licenses/by/4.0/
The gist: A key factor in effective Self-Supervised learning (SSL) is preventing dimensional collapse, where higher-dimensional representation spaces (R) span a lower-dimensional subspace.
Terminology
Abstract
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.
Sources
- Critical Learning Periods in Deep Neural Networks
- VICReg: Variance-Invariance-Covariance Regularization for Self-Supervised Learning
- Improved Baselines with Momentum Contrastive Learning
- CINIC-10 is not ImageNet or CIFAR-10
- Learning Robust Representations via Multi-View Information Bottleneck
- On the duality between contrastive and non-contrastive self-supervised learning
- Understanding Dimensional Collapse in Contrastive Self-supervised Learning
- HEX: Hierarchical Emergence Exploitation in Self-Supervised Algorithms
- Taxes Are All You Need: Integration of Taxonomical Hierarchy Relationships into the Contrastive Loss
- Representation Learning with Contrastive Predictive Coding
- Projection Head is Secretly an Information Bottleneck
- Information Flow in Self-Supervised Learning
- LiDAR: Sensing Linear Probing Performance in Joint Embedding SSL Architectures
- The information bottleneck method
- Matrix Information Theory for Self-Supervised Learning
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks