Subspace Fitting Meets Regression: The Effects of Supervision and Orthonormality Constraints on Double Descent of Generalization Errors
Not on the map. Why?
Abstract (arXiv)
We study the linear subspace fitting problem in the overparameterized setting, where the estimated subspace can perfectly interpolate the training examples. Our scope includes the least-squares solutions to subspace fitting tasks with varying levels of supervision in the training data (i.e., the proportion of input-output examples of the desired low-dimensional mapping) and orthonormality of the vectors defining the learned operator. This flexible family of problems connects standard, unsupervised subspace fitting that enforces strict orthonormality with a corresponding regression task that is fully supervised and does not constrain the linear operator structure. This class of problems is defined over a supervision-orthonormality plane, where each coordinate induces a problem instance with a unique pair of supervision level and softness of orthonormality constraints. We explore this plane and show that the generalization errors of the corresponding subspace fitting problems follow double descent trends as the settings become more supervised and less orthonormally constrained.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 25 Feb 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 0; 2023: 3; 2024: 2; 2025: 1; 2026: 1.
11 papers.
- 2021A Farewell to the Bias-Variance Tradeoff? An Overview of the Theory of Overparameterized Machine Learningcited by 54
- 2021The Common Intuition to Transfer Learning Can Win or Lose: Case Studies for Linear Regressioncited by 6
- 2021Double Descent and Other Interpolation Phenomena in GANscited by 4
- 2024TL-PCA: Transfer Learning of Principal Component Analysiscited by 4
- 2023Does Double Descent Occur in Self-Supervised Learning?cited by 3
- 2023How Much Training Data is Memorized in Overparameterized Autoencoders? An Inverse Problem Perspective on Memorization Evaluationcited by 2
- 2021Asymptotic Risk of Overparameterized Likelihood Models: Double Descent Theory for Deep Neural Networkscited by 1
- 2023Understanding the Role of Optimization in Double Descentcited by 0
- 2024Investigating the Impact of Model Complexity in Large Language Modelscited by 0
- 2025On the Relationship Between Double Descent of CNNs and Shape/Texture Bias Under Learning Processcited by 0
- 2026Stochastic Trust-Region Methods for Over-parameterized Modelscited by 0
- 2026Stochastic Trust-Region Methods for Over-parameterized Models15 Apr 2026
- 2025On the Relationship Between Double Descent of CNNs and Shape/Texture Bias Under Learning Process4 Mar 2025
- 2024TL-PCA: Transfer Learning of Principal Component Analysis14 Oct 2024
- 2024Investigating the Impact of Model Complexity in Large Language Models1 Oct 2024
- 2023Understanding the Role of Optimization in Double Descent6 Dec 2023
- 2023How Much Training Data is Memorized in Overparameterized Autoencoders? An Inverse Problem Perspective on Memorization Evaluation4 Oct 2023
- 2023Does Double Descent Occur in Self-Supervised Learning?15 Jul 2023
- 2021A Farewell to the Bias-Variance Tradeoff? An Overview of the Theory of Overparameterized Machine Learning6 Sep 2021
- 2021Double Descent and Other Interpolation Phenomena in GANs7 Jun 2021
- 2021The Common Intuition to Transfer Learning Can Win or Lose: Case Studies for Linear Regression9 Mar 2021
- 2021Asymptotic Risk of Overparameterized Likelihood Models: Double Descent Theory for Deep Neural Networks28 Feb 2021