Research map / Learning theory and algorithms / Matrix and tensor methods
Faster Principal Component Regression and Stable Matrix Chebyshev Approximation
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Replace the Frostig et al. polynomial approach with the proposed near-optimal polynomial approximation and stable recurrence | PCP · PCP | ridge-regression oracle calls: Θ(γ−2 log 1/(γε)) -> O(γ−1 log 1/(γε)) | Helped |
| Replace the Frostig et al. polynomial approach with the proposed near-optimal polynomial approximation and stable recurrence | PCR · PCR | ridge-regression oracle calls: Θ(γ−2 log 1/(γλε)) -> O(γ−1 log 1/(γλε)) | Helped |
Closest papers by meaning
- Principal Component Projection Without Principal Component Analysis (ICML 2016 · similarity 0.88)
- On Robustness of Principal Component Regression (NeurIPS 2019 · similarity 0.87)
- No Double Descent in Principal Component Regression: A High-Dimensional Analysis (ICML 2024 · similarity 0.87)
- Efficient Sparse PCA via Block-Diagonalization (ICLR 2025 · similarity 0.83)
- Fast and Provable Algorithms for Sparse PCA with Improved Sample Complexity (ICML 2025 · similarity 0.82)
- Principle Component Trees and Their Persistent Homology (AAAI 2024 · similarity 0.82)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.