Research map / Learning theory and algorithms / Matrix and tensor methods
Fast Sparse Group Lasso
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 upper-bound skipping and candidate group set in BCD | Block Coordinate Descent for Sparse Group Lasso · pyrim | number of computations for Eq. (4): 7.667×107 -> 7.523 × 106 | Helped |
| use upper-bound skipping and candidate group set in BCD | Block Coordinate Descent for Sparse Group Lasso · six LIBSVM datasets | processing time: up to 97% reduction | Helped |
| use upper-bound skipping and candidate group set in BCD | Block Coordinate Descent for Sparse Group Lasso · abalone | prediction error: 2.232 -> 2.232 | No clear effect |
| use fast BCD instead of GAP Safe / dynamic GAP Safe screening | Sparse Group Lasso solvers · six datasets, alpha in 0.2-0.8 | processing time | Helped |
Closest papers by meaning
- GAP Safe Screening Rules for Sparse-Group Lasso (NeurIPS 2016 · similarity 0.90)
- Dual Feature Reduction for the Sparse-group Lasso and its Adaptive Variant (ICML 2025 · similarity 0.88)
- Transformer Learns Optimal Variable Selection in Group-Sparse Classification (ICLR 2025 · similarity 0.84)
- Block Acceleration Without Momentum: On Optimal Stepsizes of Block Gradient Descent for Least-Squares (ICML 2024 · similarity 0.83)
- SequentialAttention++ for Block Sparsification: Differentiable Pruning Meets Combinatorial Optimization (NeurIPS 2024 · similarity 0.83)
- GSE: Group-wise Sparse and Explainable Adversarial Attacks (ICLR 2025 · similarity 0.83)
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.