mlsanityData to 14 Oct 2026

Diagonal Attenuation: A Finite-Sample Correction for PCA

arXiv 2609.05796 ↗First posted 5 Sep 2026stat.ML cs.LG math.STcited by 0

Not on the map. Why?

Abstract (arXiv)

Principal component analysis (PCA) can rotate away from its population target when a covariance matrix is estimated from limited data. We introduce diagonal attenuation, which preserves sample cross-covariances while reducing coordinatewise sample variances. The method is revealed exactly by averaging a linear full-output reconstruction loss over random input masks; studying the correction directly extends it beyond the range attainable by masking. We isolate the part of the random coupling between retained and omitted population directions that is contributed by sample-variance errors, and show how attenuation can reduce the resulting rotation. Under balanced marginal variances, we derive an explicit expected-risk theorem, uniform over the attenuation path for all sufficiently large finite samples, and obtain the asymptotically risk-minimizing strength. For general covariances, we characterize when attenuation leaves the population PCA subspace unchanged and give a risk theorem that also accounts for changing eigengaps and the population cost when the target moves. Simulations track this tradeoff from exact preservation back to PCA. Across local image patches, speech spectra, and smartphone acceleration, both mask-derived and direct attenuation improve PCA under two fitting-sample budgets, and one of them has the largest mean gain among seven methods in every data--budget cell. The full path selects strengths beyond the mask-derived boundary on 63%--95% of the subsamples.

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

Builds on

9 of 29 references.

References · 9

  1. 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,403
  2. 2013Dropout Training as Adaptive Regularizationcited by 93
  3. 2021The Power of Contrast for Feature Learning: A Theoretical Analysiscited by 53
  4. 2023Understanding Masked Autoencoders via Hierarchical Latent Variable Modelscited by 39
  5. 2018Heteroskedastic PCA: Algorithm, Optimality, and Applicationscited by 34
  6. 2022The good, the bad and the ugly sides of data augmentation: An implicit spectral regularization perspectivecited by 24
  7. 2018Learning Dynamics of Linear Denoising Autoencoderscited by 16
  8. 2025From Linearity to Non-Linearity: How Masked Autoencoders Capture Spatial Correlationscited by 2
  9. 2025A Geometric Analysis of PCAcited by 2

Built on by

Not cited yet.