Research map / Learning theory and algorithms / Matrix and tensor methods
Adaptive Forward Stepwise: A Method for High Sparsity Regression
Ivy Zhang, Robert Tibshirani
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 |
|---|---|---|---|
| use AFS instead of LASSO | AFS · Simulation example 1 (n=100, p=120, SNR 4.42, corr 0.06) | selected features (L0 norm): 19 -> 5 | Improved |
| add shrinkage and interpolation toward LASSO (AFS) to forward stepwise | FS · Simulation example 2 (n=120, p=100, SNR 2.78, corr 0.56) | MSE | Improved |
| use AFS instead of relaxed LASSO | AFS · high-dimensional, high-correlation simulation | robustness and sparsity | Hurt |
Closest papers by meaning
- Sparse Bayesian Learning via Stepwise Regression (ICML 2021 · similarity 0.88)
- A minimax optimal approach to high-dimensional double sparse linear regression (JMLR 2024 · similarity 0.87)
- Feature Adaptation for Sparse Linear Regression (NeurIPS 2023 · similarity 0.87)
- Joint Model and Data Sparsification via the Marginal Likelihood (ICML 2026 · similarity 0.87)
- Elastic Gradient Descent, an Iterative Optimization Method Approximating the Solution Paths of the Elastic Net (JMLR 2023 · similarity 0.87)
- Adaptive Feature Selection: Computationally Efficient Online Sparse Linear Regression under RIP (ICML 2017 · similarity 0.87)
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.
