Fetching the paper…
Reading the bibliography…
Generalized Linear Models (GLM) form a wide class of regression and classification models, where prediction is a function of a linear combination of the input variables.
Studies in Nonlinear Programming
K. Arrow, L. Hurwicz, and H. Uzawa · 1958
Earlier work this paper cites.
Techniques for removing nonbinding constraints and extraneous variables from linear programming problems
G. Thompson, F. Tonge, and S. Zionts · 1966
Earlier work this paper cites.
Nonlinear optimization by successive linear programming
F. Palacios-Gomez, L. Lasdon, and M. Engquist · 1982
Earlier work this paper cites.
A constraint selection technique for a class of linear programs
D. Myers and W. Shih · 1988
Earlier work this paper cites.
Generalized Linear Models, Second Edition
P. McCullagh and J.A. Nelder · 1989
Earlier work this paper cites.
Convex analysis and minimization algorithms. II , volume 306
J.-B. Hiriart-Urruty and C. Lemaréchal · 1993
Earlier work this paper cites.
Atomic decomposition by basis pursuit
S. S. Chen and D. L. Donoho · 1995
Earlier work this paper cites.
Regression shrinkage and selection via the lasso
R. Tibshirani · 1996
Earlier work this paper cites.
Convergence of a block coordinate descent method for nondifferentiable minimization
P. Tseng · 2001
Earlier work this paper cites.
Convex optimization
S. Boyd and L. Vandenberghe · 2004
Earlier work this paper cites.
On sparse representations in arbitrary redundant bases
J.-J. Fuchs · 2004
Earlier work this paper cites.
Model selection and estimation in regression with grouped variables
M. Yuan and Y. Lin · 2006
Earlier work this paper cites.
Pathwise coordinate optimization
J. Friedman, T. J. Hastie, H. Höfling, and R. Tibshirani · 2007
Earlier work this paper cites.
Identifying active manifolds
W. L. Hare and A. S. Lewis · 2007
Earlier work this paper cites.
An interior-point method for large-scale l1-regularized logistic regression
K. Koh, S.-J. Kim, and S. Boyd · 2007
Earlier work this paper cites.
Liblinear: A library for large linear classification
R.-E. Fan, K.-W. Chang, C.-J. Hsieh, X.-R. Wang, and C.-J. Lin · 2008
Earlier work this paper cites.
Sure independence screening for ultrahigh dimensional feature space
J. Fan and J. Lv · 2008
Earlier work this paper cites.
Fixed-point continuation for ℓ 1 \ell_{1} -minimization: Methodology and convergence
E. Hale, W. Yin, and Y. Zhang · 2008
Earlier work this paper cites.
The group-lasso for generalized linear models: uniqueness of solutions and efficient algorithms
V. Roth and B. Fischer · 2008
Earlier work this paper cites.
Regularization paths for generalized linear models via coordinate descent
J. Friedman, T. J. Hastie, and R. Tibshirani · 2010
Earlier work this paper cites.
Sparse coding for machine learning, image processing and computer vision
J. Mairal · 2010
Earlier work this paper cites.
Joint covariate selection and joint subspace selection for multiple classification problems
G. Obozinski, B. Taskar, and M. I. Jordan · 2010
Earlier work this paper cites.
Convex analysis and monotone operator theory in Hilbert spaces
H. H. Bauschke and P. L. Combettes · 2011
Earlier work this paper cites.
Cython: The best of both worlds
S. Behnel, R. Bradshaw, C. Citro, L. Dalcin, D. S. Seljebotn, and K. Smith · 2011
Cited alongside, same era.
Square-root Lasso: pivotal recovery of sparse signals via conic programming
A. Belloni, V. Chernozhukov, and L. Wang · 2011
Cited alongside, same era.
A first-order primal-dual algorithm for convex problems with applications to imaging
A. Chambolle and T. Pock · 2011
Cited alongside, same era.
Accelerating ISTA with an active set strategy
M. Kowalski, P. Weiss, A. Gramfort, and S. Anthoine · 2011
Cited alongside, same era.
Scikit-learn: Machine learning in Python
F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R. Weiss, V. Dubourg, J. Vanderplas, A. Passos, D. Cournapeau, M. Brucher, M. Perrot, and E. Duchesnay · 2011
Cited alongside, same era.
Convex optimization with sparsity-inducing norms
F. Bach, R. Jenatton, J. Mairal, and G. Obozinski · 2012
A coordinate descent primal-dual algorithm with large step size and possibly non separable functions
O. Fercoq and P. Bianchi · 2015
Later among the works it cites.
Accelerated, parallel and proximal coordinate descent
O. Fercoq and P. Richtárik · 2015
Later among the works it cites.
Mind the duality gap: safer rules for the lasso
O. Fercoq, A. Gramfort, and J. Salmon · 2015
Later among the works it cites.
Blitz: A principled meta-algorithm for scaling sparse optimization
T. B. Johnson and C. Guestrin · 2015
Later among the works it cites.
Numba: A LLVM-based Python JIT Compiler
S. K. Lam, A. Pitrou, and S. Seibert · 2015
Later among the works it cites.
Gap safe screening rules for sparse multi-task and multi-class models
E. Ndiaye, O. Fercoq, A. Gramfort, and J. Salmon · 2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Safe feature elimination in sparse supervised learning
L. El Ghaoui, V. Viallon, and T. Rabbani · 2012
Cited alongside, same era.
Mixed-norm estimates for the M/EEG inverse problem using accelerated gradient methods
A. Gramfort, M. Kowalski, and M. Hämäläinen · 2012
Cited alongside, same era.
Proximal Newton-type methods for convex optimization
J. Lee, Y. Sun, and M. Saunders · 2012
Cited alongside, same era.
Strong rules for discarding predictors in lasso-type problems
R. Tibshirani, J. Bien, J. Friedman, T. J. Hastie, N. Simon, J. Taylor, and R. J. Tibshirani · 2012
Cited alongside, same era.
Lasso screening rules via dual polytope projection
J. Wang, P. Wonka, and J. Ye · 2012
Cited alongside, same era.
An improved GLMNET for l1-regularized logistic regression
G Yuan, C.-H Ho, and C.-J Lin · 2012
Cited alongside, same era.
Later among the works it cites.
Model selection with low complexity priors
S. Vaiter, M. Golbabaee, J. Fadili, and G. Peyré · 2015
Later among the works it cites.
CVXPY: A Python-embedded modeling language for convex optimization
S. Diamond and S. Boyd · 2016
Later among the works it cites.
Primal-dual rates and certificates
C. Dünner, S.Forte, M. Takáč, and M. Jaggi · 2016
Later among the works it cites.
GAP safe screening rules for sparse-group-lasso
E. Ndiaye, O. Fercoq, A. Gramfort, and J. Salmon · 2016
Later among the works it cites.
A fast active set block coordinate descent algorithm for ℓ 1 \ell_{1} -regularized least squares
M. De Santis, S. Lucidi, and F. Rinaldi · 2016
Later among the works it cites.
Regularized nonlinear acceleration
D. Scieur, A. d’Aspremont, and F. Bach · 2016
Later among the works it cites.
Screening tests for lasso problems
Z. J. Xiang, Y. Wang, and P. J. Ramadge · 2016
Later among the works it cites.
StingyCD: Safely avoiding wasteful updates in coordinate descent
T. B. Johnson and C. Guestrin · 2017
Later among the works it cites.
From safe screening rules to working sets for faster lasso-type solvers
M. Massias, A. Gramfort, and J. Salmon · 2017
Later among the works it cites.
Gap safe screening rules for sparsity enforcing penalties
E. Ndiaye, O. Fercoq, A. Gramfort, and J. Salmon · 2017
Later among the works it cites.
Faster coordinate descent via adaptive importance sampling
D. Perekrestenko, V. Cevher, and M. Jaggi · 2017
Later among the works it cites.
Dykstra’s Algorithm, ADMM, and Coordinate Descent: Connections, Insights, and Extensions
R. J. Tibshirani · 2017
Later among the works it cites.
T. B. Johnson and C. Guestrin · 2018
Later among the works it cites.
Efficient Greedy Coordinate Descent for Composite Problems
P. Karimireddy, A. Koloskova, S. Stich, and M. Jaggi · 2018
Later among the works it cites.
Celer: a fast solver for the Lasso with dual extrapolation
M. Massias, A. Gramfort, and J. Salmon · 2018
Later among the works it cites.
Acceleration in Optimization
D. Scieur · 2018
Later among the works it cites.
Model consistency of partly smooth regularizers
S. Vaiter, G. Peyré, and J. M. Fadili · 2018
Later among the works it cites.