From safe screening rules to working sets for faster Lasso-type solvers

v1v2 (latest)

From safe screening rules to working sets for faster Lasso-type solvers

21 March 2017

Mathurin Massias

Alexandre Gramfort

ArXiv (abs)PDF HTML

Papers citing "From safe screening rules to working sets for faster Lasso-type solvers"

11 / 11 papers shown

Title
$A Generic Branch-and-Bound Algorithm for $\ell_0$-Penalized Problems with Supplementary Material$ A Generic Branch-and-Bound Algorithm for $\ell_0$ -Penalized Problems with Supplementary Material Clément Elvira Théo Guyard Cédric Herzet 58 0 0 04 Jun 2025
High-Dimensional Private Empirical Risk Minimization by Greedy Coordinate Descent Paul Mangold A. Bellet Joseph Salmon Marc Tommasi 80 5 0 04 Jul 2022
Expanding boundaries of Gap Safe screening C. Dantas Emmanuel Soubies Cédric Févotte 69 16 0 22 Feb 2021
Provably Convergent Working Set Algorithm for Non-Convex Regularized Regression A. Rakotomamonjy Rémi Flamary Gilles Gasso Joseph Salmon 47 4 0 24 Jun 2020
The Strong Screening Rule for SLOPE Johan Larsson M. Bogdan J. Wallin 56 20 0 07 May 2020
Dual Extrapolation for Sparse Generalized Linear Models Mathurin Massias Samuel Vaiter Alexandre Gramfort Joseph Salmon 408 18 0 12 Jul 2019
Large scale Lasso with windowed active set for convolutional spike sorting Laurent Dragoni Rémi Flamary Karim Lounici Patricia Reynaud-Bouret 52 0 0 28 Jun 2019
Stable safe screening and structured dictionaries for faster L1 regularization C. Dantas Rémi Gribonval 83 5 0 17 Dec 2018
A Fast, Principled Working Set Algorithm for Exploiting Piecewise Linear Structure in Convex Problems Tyler B. Johnson Carlos Guestrin 51 5 0 20 Jul 2018
Celer: a Fast Solver for the Lasso with Dual Extrapolation Mathurin Massias Alexandre Gramfort Joseph Salmon 114 72 0 21 Feb 2018
WHInter: A Working set algorithm for High-dimensional sparse second order Interaction models Marine Le Morvan Jean-Philippe Vert 78 17 0 16 Feb 2018