mlsanityData to 14 Oct 2026

On the Asymptotics of Self-Supervised Pre-training: Two-Stage M-Estimation and Representation Symmetry

arXiv 2603.27631 ↗First posted 29 Mar 2026cs.LG stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

Self-supervised pre-training, where large corpora of unlabeled data are used to learn representations for downstream fine-tuning, has become a cornerstone of modern machine learning. While a growing body of theoretical work has begun to analyze this paradigm, existing bounds leave open the question of how sharp the current rates are, and whether they accurately capture the complex interaction between pre-training and fine-tuning. In this paper, we address this gap by developing an asymptotic theory of pre-training via two-stage M-estimation. A key challenge is that the pre-training estimator is often identifiable only up to a group symmetry, a feature common in representation learning that requires careful treatment. We address this issue using tools from Riemannian geometry to study the intrinsic parameters of the pre-training representation, which we link with the downstream predictor through a notion of orbit-invariance, precisely characterizing the limiting distribution of the downstream test risk. We apply our main result to several case studies, including spectral pre-training, factor models, and Gaussian mixture models, and obtain substantial improvements in problem-specific factors over prior art when applicable.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 3 of its 65 references that are in the map. First posted on arXiv 29 Mar 2026.

Builds on

3 of 65 references.

References · 3

  1. 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
  2. 2025A Statistical Theory of Contrastive Pre-training and Multimodal Generative AIcited by 13
  3. 2024Asymptotic Normality of Generalized Low-Rank Matrix Sensing via Riemannian Geometrycited by 1

Built on by

Not cited yet.