No Double Descent in Principal Component Regression: A High-Dimensional Analysis
No confident code implementation found for this paper. 1 possible match can be shown below.
No confident code implementation found for this paper. 1 possible match can be shown below.
No confident code match yet
We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.
No code implementations found yet.
Know of an implementation? Let us know in the comments below!
Node2ket: Efficient High-Dimensional Network Embedding in Quantum Hilbert Space
Sequential Asynchronous Action Coordination in Multi-Agent Systems: A Stackelberg Decision Transformer Approach
Actively Testing Your Model While It Learns: Realizing Label-Efficient Learning in Practice
Enhancing Vision Transformer: Amplifying Non-Linearity in Feedforward Network Module
Rethinking Classifier Re-Training in Long-Tailed Recognition: Label Over-Smooth Can Balance
PTADisc: A Cross-Course Dataset Supporting Personalized Learning in Cold-Start Scenarios
@article{gedon2026double,
title = {No Double Descent in Principal Component Regression: A High-Dimensional Analysis},
author = {Daniel Gedon and Antônio H. Ribeiro and Thomas B. Schön},
year = {2026},
url = {https://api.semanticscholar.org/CorpusID:3edfba67597f149da1d3cd47a42a5338833e5036},
journal = {ICML 2024 2024}
}Shows whether official code is linked for this paper.
[](https://codeofpaper.com/paper/3edfba67597f149da1d3cd47a42a5338833e5036)