Research map / Learning theory and algorithms / Matrix and tensor methods
A Practical Scheme and Fast Algorithm to Tune the Lasso With Optimality Guarantees
Michael Chichignoud, Johannes Lederer, Martin J. Wainwright
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 |
|---|---|---|---|
| calibrate Lasso with AV-inf instead of 10-fold Cross-Validation | Lasso · Simulated linear regression (n=200, p=300/900, kappa 0/0.2/0.4) | sup-norm error | Improved |
| apply safe threshold 3C lambda after AV-inf calibration | Lasso with AV-inf · Simulated linear regression (n=200, p=300/900) | false positives and false negatives | Improved |
| use AV-inf instead of 10-fold Cross-Validation | Lasso · Computational cost | computation time: 10 Lasso paths -> one Lasso path (about 10 times more efficient) | Improved |
Closest papers by meaning
- Fast Screening Rules for Optimal Design via Quadratic Lasso Reformulation (JMLR 2023 · similarity 0.89)
- The Well-Tempered Lasso (ICML 2018 · similarity 0.88)
- Semi-Analytic Resampling in Lasso (JMLR 2019 · similarity 0.88)
- Sharp Oracle Inequalities for Square Root Regularization (JMLR 2017 · similarity 0.88)
- Approximate Leave-One-Out for Fast Parameter Tuning in High Dimensions (ICML 2018 · similarity 0.87)
- A Comparison of Hamming Errors of Representative Variable Selection Methods (ICLR 2022 · 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.
