Research map / Learning theory and algorithms / Matrix and tensor methods
GAP Safe Screening Rules for 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 dynamic GAP Safe screening instead of the compared screening rules | ISTA-BC for Sparse-Group Lasso · Synthetic dataset (ρ = 0.5, γ1 = 10, γ2 = 4, τ = 0.2) | computation time: 212s -> 65s | Helped |
| Use dynamic GAP Safe screening instead of the compared screening rules | ISTA-BC for Sparse-Group Lasso · NCEP/NCAR Reanalysis 1 | speedup: up to a 5x speed up | Helped |
Closest papers by meaning
- Fast Sparse Group Lasso (NeurIPS 2019 · similarity 0.90)
- Screening rules for Lasso with non-convex Sparse Regularizers (ICML 2019 · similarity 0.89)
- Dual Feature Reduction for the Sparse-group Lasso and its Adaptive Variant (ICML 2025 · similarity 0.88)
- Bilevel learning of the Group Lasso structure (NeurIPS 2018 · similarity 0.87)
- Implicit Regularization for Group Sparsity (ICLR 2023 · similarity 0.87)
- Beyond Minimax Rates in Group Distributionally Robust Optimization via a Novel Notion of Sparsity (ICML 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.