Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 49 min ago
PreprintCC BY 4.0arXiv

Awakening of the Buddha: Subspace Learning During Population-Loss Plateaus

Abstract

Population loss can remain nearly constant while a neural network learns a substantially more predictive representation. We establish this separation for two-layer ReLU and leaky-ReLU networks trained on Gaussian inputs by simultaneous fixed-step population gradient descent on all parameters. For structured additive teachers whose links are positive mixtures of Gaussian-damped cubics in H1(γ), we give explicit conditions under which small IID Gaussian initialization yields a high-probability guarantee: at a checkpoint during a high-loss plateau, minimum alignment between the rank-r teacher subspace and the leading r-dimensional eigenspace of the predictor's average gradient outer product (AGOP) increases by at least 1/2, and the minimum refit MSE under unchanged coefficient budgets decreases by more than $0.399$, both relative to initialization. The same trajectory subsequently attains a trained loss below every value in the plateau window. A complementary result treats unequal-weight cubic teachers and small additive Sobolev perturbations using projected-feature refits. For SwiGLU networks with an exactly fitted intercept, we prove leading-AGOP alignment during a loss plateau at fixed width and dimension as Gaussian initialization vanishes, for square-integrable teachers with nonzero Hermite content of degree one, two, or three. A rank-one cubic specialization also gives simultaneous unrestricted-refit gains at a prescribed width. An approximation lower bound further shows that certain interaction targets retain nonzero error when ridge neurons are restricted to shared orthogonal axes within the teacher subspace. Population-moment experiments with ReLU students across 21 teachers and 50 initializations per teacher complement the analysis.

Related

  1. The Geometry of Multitask Learning: Sharp Rates for Shared Subspace Estimation
    Tony Cai, Abhinav Chakraborty, Samory Kpotufe
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  2. Optimal Personalized Subspace Learning for Multi-view Tensor Observations
    Kangxiang Qin, Zeyu Li, Xinbing Kong +1
    arXivPreprintCC BY-NC-ND 4.0Full textStatisticsarXiv
  3. Subspace Learning with Interval-Censored Likelihoods for Dequantizing Percept PC LFP Snapshots
    Shreesh Karjagi, Elif Ceren Fitoz, Maryam Khalid +5
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  4. Spectral and Subspace Dynamics of LoRA in Supervised Fine-Tuning and Reinforcement Learning
    Chenruo Liu, Zihan Wang, Yijun Dong +1
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  5. From Barren Plateaus to SPSA Optimization in Variational Quantum Eigensolvers
    Zhen Qin
    arXivPreprintarXiv licenceFull textOptimisation & controlQuantum physics & quantum informationarXiv
BibTeX
@misc{kumar2026awakening,
  title = {{Awakening of the Buddha: Subspace Learning During Population-Loss Plateaus}},
  author = {Akash Kumar},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.39408},
  eprint = {2609.39408},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.39408},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Awakening of the Buddha: Subspace Learning During Population-Loss Plateaus
AU  - Akash Kumar
PY  - 2026
DA  - 2026/09/30
PB  - arXiv
DO  - 10.48550/arxiv.2609.39408
UR  - https://arxiv.org/abs/2609.39408
AB  - Population loss can remain nearly constant while a neural network learns a substantially more predictive representation. We establish this separation for two-layer ReLU and leaky-ReLU networks trained on Gaussian inputs by simultaneous fixed-step population gradient descent on all parameters. For structured additive teachers whose links are positive mixtures of Gaussian-damped cubics in H^1(γ), we give explicit conditions under which small IID Gaussian initialization yields a high-probability guarantee: at a checkpoint during a high-loss plateau, minimum alignment between the rank-r teacher subspace and the leading r-dimensional eigenspace of the predictor's average gradient outer product (AGOP) increases by at least 1/2, and the minimum refit MSE under unchanged coefficient budgets decreases by more than $0.399$, both relative to initialization. The same trajectory subsequently attains a trained loss below every value in the plateau window. A complementary result treats unequal-weight cubic teachers and small additive Sobolev perturbations using projected-feature refits. For SwiGLU networks with an exactly fitted intercept, we prove leading-AGOP alignment during a loss plateau at fixed width and dimension as Gaussian initialization vanishes, for square-integrable teachers with nonzero Hermite content of degree one, two, or three. A rank-one cubic specialization also gives simultaneous unrestricted-refit gains at a prescribed width. An approximation lower bound further shows that certain interaction targets retain nonzero error when ridge neurons are restricted to shared orthogonal axes within the teacher subspace. Population-moment experiments with ReLU students across 21 teachers and 50 initializations per teacher complement the analysis.
ER  -