A Theoretical Analysis of Self-Supervised Learning for Vision Transformers
Not on the map. Why?
Abstract (arXiv)
Self-supervised learning has become a cornerstone in computer vision, primarily divided into reconstruction-based methods like masked autoencoders (MAE) and discriminative methods such as contrastive learning (CL). Recent empirical observations reveal that MAE and CL capture different types of representations: CL tends to focus on global patterns, while MAE adeptly captures both global and subtle local information simultaneously. Despite a flurry of recent empirical investigations to shed light on this difference, theoretical understanding remains limited, especially on the dominant architecture vision transformers (ViTs). In this paper, to provide rigorous insights, we model the visual data distribution by considering two types of spatial features: dominant global features and comparatively minuscule local features, and study the impact of imbalance among these features. We analyze the training dynamics of one-layer softmax-based ViTs on both MAE and CL objectives using gradient descent. Our analysis shows that as the degree of feature imbalance varies, ViTs trained with the MAE objective effectively learn both global and local features to achieve near-optimal reconstruction, while the CL-trained ViTs favor predominantly global features, even under mild imbalance. These results provide a theoretical explanation for distinct behaviors of MAE and CL observed in empirical studies.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 4 Mar 2024.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2024: 1; 2025: 3; 2026: 2.
6 papers.
- 2025Training Dynamics of In-Context Learning in Linear Attentioncited by 46
- 2026Preconditioning Benefits of Spectral Orthogonalization in Muoncited by 30
- 2024Training Dynamics of Transformers to Recognize Word Co-occurrence via Gradient Flow Analysiscited by 9
- 2025Transformers Provably Learn Directed Acyclic Graphs via Kernel-Guided Mutual Informationcited by 2
- 2025Eigenfunction Extraction for Ordered Representation Learningcited by 0
- 2026Expressivity In Multimodal Contrastive Learningcited by 0
- 2026Expressivity In Multimodal Contrastive Learning17 Aug 2026
- 2026Preconditioning Benefits of Spectral Orthogonalization in Muon20 Jan 2026
- 2025Transformers Provably Learn Directed Acyclic Graphs via Kernel-Guided Mutual Information29 Oct 2025
- 2025Eigenfunction Extraction for Ordered Representation Learning28 Oct 2025
- 2025Training Dynamics of In-Context Learning in Linear Attention27 Jan 2025
- 2024Training Dynamics of Transformers to Recognize Word Co-occurrence via Gradient Flow Analysis12 Oct 2024