Research map / Learning theory and algorithms / Combinatorial and search optimization
Celer: a Fast Solver for the Lasso with Dual Extrapolation
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 |
|---|---|---|---|
| use dual extrapolation to construct dual points | CD with Gap Safe screening on Finance/E2006-log1p · Finance/E2006-log1p, λ=λmax/5 | computation time (seconds): 290 s -> 70 s | Helped |
| use dual extrapolation in CELER instead of BLITZ's dual-point strategy | Lasso solver on Finance/E2006-log1p · Finance/E2006-log1p, λ=λmax/20 | computation time (seconds), ε=10−6: 30 -> 10 | Helped |
| enable dynamic pruning of the working set (ablation) | CELER on Finance Lasso path · Finance/E2006-log1p, 100 λ values | path computation time | No clear effect |
Closest papers by meaning
- Screening rules for Lasso with non-convex Sparse Regularizers (ICML 2019 · similarity 0.89)
- Random extrapolation for primal-dual coordinate descent (ICML 2020 · similarity 0.87)
- Robust Model Reasoning and Fitting via Dual Sparsity Pursuit (NeurIPS 2023 · similarity 0.86)
- Primal-Dual Rates and Certificates (ICML 2016 · similarity 0.86)
- GAP Safe Screening Rules for Sparse-Group Lasso (NeurIPS 2016 · similarity 0.86)
- Global Minimizers of $\ell^p$-Regularized Objectives Yield the Sparsest ReLU Neural Networks (NeurIPS 2025 · similarity 0.85)
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.