mlsanityData to 7 Oct 2026

A solvable high-dimensional model where nonlinear autoencoders learn structure invisible to PCA while test loss misaligns with generalization

arXiv 2602.10680 ↗First posted 11 Feb 2026stat.ML cond-mat.dis-nn cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

Many real-world datasets contain hidden structure that cannot be detected by simple linear correlations between input features. For example, latent factors may influence the data in a coordinated way, even though their effect is invisible to covariance-based methods such as PCA. In practice, nonlinear neural networks often succeed in extracting such hidden structure in unsupervised and self-supervised learning. However, constructing a minimal high-dimensional model where this advantage can be rigorously analyzed has remained an open theoretical challenge. We introduce a tractable high-dimensional spiked model with two latent factors: one visible to covariance, and one statistically dependent yet uncorrelated, appearing only in higher-order moments. PCA and linear autoencoders fail to recover the latter, while a minimal nonlinear autoencoder provably extracts both. We analyze both the population risk, and empirical risk minimization. Our model also provides a tractable example where self-supervised test loss is poorly aligned with representation quality: nonlinear autoencoders recover latent structure that linear methods miss, even though their reconstruction loss is higher.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 20 of its 52 references that are in the map. First posted on arXiv 11 Feb 2026.

Builds on

20 of 52 references.

References · 20

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,339
  3. 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
  4. 2019Generative Modeling by Estimating Gradients of the Data Distributioncited by 4,067
  5. 2015Statistical physics of inference: Thresholds and algorithmscited by 128
  6. 2020Online stochastic gradient descent on non-convex losses from high-dimensional inferencecited by 119
  7. 2022High-dimensional limit theorems for SGD: Effective dynamics and critical scalingcited by 69
  8. 2018The committee machine: Computational to statistical gaps in learning a two-layers neural networkcited by 58
  9. 2013Spectral redemption: clustering sparse networkscited by 54
  10. 2024Learning by Reconstruction Produces Uninformative Features For Perceptioncited by 54
  11. 2022Phase diagram of Stochastic Gradient Descent in high-dimensional two-layer neural networkscited by 50
  12. 2020The estimation error of general first order methodscited by 33
8 more
  1. 2022The dynamics of representation learning in shallow, non-linear autoencoderscited by 27
  2. 2015MMSE of probabilistic low-rank matrix estimation: Universality with respect to the output channelcited by 22
  3. 2023High-dimensional Asymptotics of Denoising Autoencoderscited by 19
  4. 2016On the low-rank approach for semidefinite programs arising in synchronization and community detectioncited by 17
  5. 2024Sliding down the stairs: how correlated latent variables accelerate learning with neural networkscited by 12
  6. 2025Asymptotics of Non-Convex Generalized Linear Models in High-Dimensions: A proof of the replica formulacited by 11
  7. 2025Feature learning from non-Gaussian inputs: the case of Independent Component Analysis in high dimensionscited by 7
  8. 2025Computational Thresholds in Multi-Modal Learning via the Spiked Matrix-Tensor Modelcited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 7.

7 papers.