mlsanityData to 14 Oct 2026

Calibrated Principal Component Regression

arXiv 2510.19020 ↗First posted 21 Oct 2025stat.ML cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

We propose a new method for statistical inference in generalized linear models. In the overparameterized regime, Principal Component Regression (PCR) reduces variance by projecting high-dimensional data to a low-dimensional principal subspace before fitting. However, PCR incurs truncation bias whenever the true regression vector has mass outside the retained principal components (PC). To mitigate the bias, we propose Calibrated Principal Component Regression (CPCR), which first learns a low-variance prior in the PC subspace and then calibrates the model in the original feature space via a centered Tikhonov step. CPCR leverages cross-fitting and controls the truncation bias by softening PCR's hard cutoff. Theoretically, we calculate the out-of-sample risk in the random matrix regime, which shows that CPCR outperforms standard PCR when the regression signal has non-negligible components in low-variance directions. Empirically, CPCR consistently improves prediction across multiple overparameterized problems. The results highlight CPCR's stability and flexibility in modern overparameterized settings.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 25 of its 54 references that are in the map. First posted on arXiv 21 Oct 2025.

Builds on

25 of 54 references.

References · 25

  1. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
  2. 2022CoCa: Contrastive Captioners are Image-Text Foundation Modelscited by 1,274
  3. 2020In Search of Lost Domain Generalizationcited by 1,054
  4. 2017Deeper, Broader and Artier Domain Generalizationcited by 986
  5. 2021Florence: A New Foundation Model for Computer Visioncited by 804
  6. 2019Benign Overfitting in Linear Regressioncited by 549
  7. 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 513
  8. 2020Benign overfitting in ridge regressioncited by 153
  9. 2015High-Dimensional Asymptotics of Prediction: Ridge Regression and Classificationcited by 148
  10. 2018A Continuous-Time View of Early Stopping for Least Squarescited by 69
  11. 2022Dimension free ridge regressioncited by 51
  12. 2023High-dimensional analysis of double descent for linear regression with random projectionscited by 47
13 more
  1. 2025Predictions as Surrogates: Revisiting Surrogate Outcomes in the Age of AIcited by 34
  2. 2019On Robustness of Principal Component Regressioncited by 28
  3. 2024A Comprehensive Review of Latent Space Dynamics Identification Algorithms for Intrusive and Non-Intrusive Reduced-Order-Modelingcited by 22
  4. 2021Harmless interpolation in regression and classification with structured featurescited by 14
  5. 2020Latent-space time evolution of non-intrusive reduced-order models using Gaussian process emulationcited by 11
  6. 2022On Non-Random Missing Labels in Semi-Supervised Learningcited by 11
  7. 2024Label Noise: Ignorance Is Blisscited by 9
  8. 2024Overfitting Behaviour of Gaussian Kernel Ridgeless Regression: Varying Bandwidth or Dimensionalitycited by 7
  9. 2023Adaptive Principal Component Regression with Applications to Panel Datacited by 5
  10. 2020Supervised PCA: A Multiobjective Approachcited by 3
  11. 2025Domain Generalization Under Posterior Driftcited by 3
  12. 2024Learning Low-dimensional Latent Dynamics from High-dimensional Observations: Non-asymptotics and Lower Boundscited by 2
  13. 2021A New Perspective on Debiasing Linear Regressionscited by 1

Built on by

Not cited yet.