Understanding Self-Supervised Learning via Latent Distribution Matching

Self-supervised learning (SSL) excels at finding general-purpose latent representations from complex data, yet lacks a unifying theoretical framework that explains the diverse existing methods and guides the design of new ones. We cast SSL as latent distribution matching (DM): learning representations that maximize their log-probability under an assumed latent model (alignment), while maximizing latent entropy to prevent collapse (uniformity). This view unifies independent component analysis with contrastive, non-contrastive, and predictive SSL methods, including stop-gradient approaches. Leveraging DM, we derive a nonlinear, sampling-free Bayesian filtering model with a Kalman-based predictor for high-dimensional timeseries. We further prove that predictive DM yields identifiable latent representations under mild assumptions, even with nonlinear predictors. Overall, DM clarifies the assumptions behind established SSL methods and provides principled guidance for developing new approaches.