A solvable high-dimensional model where nonlinear autoencoders learn structure invisible to PCA while test loss misaligns with generalization
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
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,339
- 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
- 2019Generative Modeling by Estimating Gradients of the Data Distributioncited by 4,067
- 2015Statistical physics of inference: Thresholds and algorithmscited by 128
- 2020Online stochastic gradient descent on non-convex losses from high-dimensional inferencecited by 119
- 2022High-dimensional limit theorems for SGD: Effective dynamics and critical scalingcited by 69
- 2018The committee machine: Computational to statistical gaps in learning a two-layers neural networkcited by 58
- 2013Spectral redemption: clustering sparse networkscited by 54
- 2024Learning by Reconstruction Produces Uninformative Features For Perceptioncited by 54
- 2022Phase diagram of Stochastic Gradient Descent in high-dimensional two-layer neural networkscited by 50
- 2020The estimation error of general first order methodscited by 33
8 more
- 2022The dynamics of representation learning in shallow, non-linear autoencoderscited by 27
- 2015MMSE of probabilistic low-rank matrix estimation: Universality with respect to the output channelcited by 22
- 2023High-dimensional Asymptotics of Denoising Autoencoderscited by 19
- 2016On the low-rank approach for semidefinite programs arising in synchronization and community detectioncited by 17
- 2024Sliding down the stairs: how correlated latent variables accelerate learning with neural networkscited by 12
- 2025Asymptotics of Non-Convex Generalized Linear Models in High-Dimensions: A proof of the replica formulacited by 11
- 2025Feature learning from non-Gaussian inputs: the case of Independent Component Analysis in high dimensionscited by 7
- 2025Computational Thresholds in Multi-Modal Learning via the Spiked Matrix-Tensor Modelcited by 5
Built on by
Citing papers per year: 2026: 7.
7 papers.
- 2026A theory of learning data statistics in diffusion models, from easy to hardcited by 5
- 2026Biased Generalization in Diffusion Modelscited by 3
- 2026High-Dimensional Theory of LoRA Fine-Tuning in a Solvable Attention Modelcited by 3
- 2026The Interplay of Data Structure and Imbalance in the Learning Dynamics of Diffusion Modelscited by 1
- 2026Memorisation, convergence and generalisation in generative modelscited by 1
- 2026A Fourier perspective on the learning dynamics of neural networks: from sample complexities to mechanistic insightscited by 0
- 2026Signal-to-Noise Ratio and Sample Size Govern Representational Alignment in Neural Networkscited by 0
- 2026High-Dimensional Theory of LoRA Fine-Tuning in a Solvable Attention Model4 Jun 2026
- 2026Signal-to-Noise Ratio and Sample Size Govern Representational Alignment in Neural Networks26 May 2026
- 2026Memorisation, convergence and generalisation in generative models20 May 2026
- 2026A Fourier perspective on the learning dynamics of neural networks: from sample complexities to mechanistic insights16 May 2026
- 2026The Interplay of Data Structure and Imbalance in the Learning Dynamics of Diffusion Models7 May 2026
- 2026A theory of learning data statistics in diffusion models, from easy to hard13 Mar 2026
- 2026Biased Generalization in Diffusion Models3 Mar 2026