mlsanityData to 7 Oct 2026

Safe Screening Rules for Group SLOPE

arXiv 2506.09451 ↗First posted 11 Jun 2025cs.LG stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

Variable selection is a challenging problem in high-dimensional sparse learning, especially when group structures exist. Group SLOPE performs well for the adaptive selection of groups of predictors. However, the block non-separable group effects in Group SLOPE make existing methods either invalid or inefficient. Consequently, Group SLOPE tends to incur significant computational costs and memory usage in practical high-dimensional scenarios. To overcome this issue, we introduce a safe screening rule tailored for the Group SLOPE model, which efficiently identifies inactive groups with zero coefficients by addressing the block non-separable group effects. By excluding these inactive groups during training, we achieve considerable gains in computational efficiency and memory usage. Importantly, the proposed screening rule can be seamlessly integrated into existing solvers for both batch and stochastic algorithms. Theoretically, we establish that our screening rule can be safely employed with existing optimization algorithms, ensuring the same results as the original approaches. Experimental results confirm that our method effectively detects inactive feature groups and significantly boosts computational efficiency without compromising accuracy.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 20 of its 43 references that are in the map. First posted on arXiv 11 Jun 2025.

Builds on

20 of 43 references.

References · 20

  1. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  2. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  3. 2014A Proximal Stochastic Gradient Method with Progressive Variance Reductioncited by 78
  4. 2014SLOPE - Adaptive variable selection via convex optimizationcited by 33
  5. 2015Mind the duality gap: safer rules for the Lassocited by 31
  6. 2020Fast OSCAR and OWL Regression via Safe Screening Rulescited by 25
  7. 2024Auto-Train-Once: Controller Network Guided Automatic Network Pruning from Scratchcited by 20
  8. 2016Simultaneous Safe Screening of Features and Samples in Doubly Sparse Modelingcited by 17
  9. 2014Screening Tests for Lasso Problemscited by 15
  10. 2013A Safe Screening Rule for Sparse Logistic Regressioncited by 14
  11. 2022An Accelerated Doubly Stochastic Gradient Method with Faster Explicit Model Identificationcited by 14
  12. 2016Group SLOPE - adaptive selection of groups of predictorscited by 13
8 more
  1. 2014Dynamic Screening: Accelerating First-Order Algorithms for the Lasso and Group-Lassocited by 11
  2. 2019Screening Rules for Lasso with Non-Convex Sparse Regularizerscited by 11
  3. 2016GAP Safe Screening Rules for Sparse-Group-Lassocited by 10
  4. 2020The Strong Screening Rule for SLOPEcited by 8
  5. 2014Two-Layer Feature Reduction for Sparse-Group Lasso via Decomposition of Convex Setscited by 7
  6. 2024All-in-One Tuning and Structural Pruning for Domain-Specific LLMscited by 4
  7. 2024Strong Screening Rules for Group-based SLOPE Modelscited by 2
  8. 2025Safe Screening Rules for Group OWL Modelscited by 1

Built on by

Not cited yet.