Skip to yearly menu bar Skip to main content


Beyond L1: Faster and Better Sparse Models with skglm

Quentin Bertrand · Quentin Klopfenstein · Pierre-Antoine Bannier · Gauthier Gidel · Mathurin Massias

Hall J (level 1) #910

Keywords: [ nonsmooth optimization ] [ Anderson acceleration ] [ cooridnate descent ]


We propose a new fast algorithm to estimate any sparse generalized linear model with convex or non-convex separable penalties. Our algorithm is able to solve problems with millions of samples and features in seconds, by relying on coordinate descent, working sets and Anderson acceleration. It handles previously unaddressed models, and is extensively shown to improve state-of-art algorithms. We provide a flexible, scikit-learn compatible package, which easily handles customized datafits and penalties.

Chat is not available.