One to beat them all: "RYU" -- a unifying framework for the construction of safe balls
Not on the map. Why?
Abstract (arXiv)
In this paper, we present a new framework, called "RYU" for constructing "safe" regions -- specifically, bounded sets that are guaranteed to contain the dual solution of a target optimization problem. Our framework applies to the standard case where the objective function is composed of two components: a closed, proper, convex function with Lipschitz-smooth gradient and another closed, proper, convex function. We show that the RYU framework not only encompasses but also improves upon the state-of-the-art methods proposed over the past decade for this class of optimization problems.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 13 of its 29 references that are in the map. First posted on arXiv 1 Dec 2023.
Builds on
13 of 29 references.
References · 13
- 2019Learning with Fenchel-Young Lossescited by 119
- 2016Gap Safe screening rules for sparsity enforcing penaltiescited by 39
- 2015Mind the duality gap: safer rules for the Lassocited by 33
- 2013A Safe Screening Rule for Sparse Logistic Regressioncited by 14
- 2013Safe Screening With Variational Inequalities and Its Application to LASSOcited by 11
- 2018Safe Grid Search with Optimal Complexitycited by 8
- 2020Screening Rules and its Complexity for Active Set Identificationcited by 8
- 2021Safe rules for the identification of zeros in the solutions of the SLOPE problemcited by 6
- 2019Safe squeezing for antisparse codingcited by 5
- 2021Dynamic Sasvi: Strong Safe Screening for Norm-Regularized Least Squarescited by 4
- 2021Screen & Relax: Accelerating the resolution of Elastic-net by safe identification of the solution supportcited by 4
- 2018Stable safe screening and structured dictionaries for faster L1 regularizationcited by 2
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.