Beyond L1: Faster and Better Sparse Models with skglm

Quentin Bertrand, Quentin Klopfenstein, Pierre-Antoine Bannier +2

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…