Sparse classification: a scalable discrete optimization perspective
- 2 November 2021
- journal article
- research article
- Published by Springer Nature in Machine Learning
- Vol. 110 (11-12) , 3177-3209
Abstract
No abstract availableKeywords
All Related Versions
This publication has 55 references indexed in Scilit:
- One‐Bit Compressed Sensing by Linear ProgrammingCommunications on Pure and Applied Mathematics, 2013
- Optimization with Sparsity-Inducing PenaltiesFoundations and Trends in Machine Learning, 2012
- SparseNet: Coordinate Descent With Nonconvex PenaltiesJournal of the American Statistical Association, 2011
- Sure independence screening in generalized linear models with NP-dimensionalityThe Annals of Statistics, 2010
- Pegasos: primal estimated sub-gradient solver for SVMMathematical Programming, 2010
- Nearly unbiased variable selection under minimax concave penaltyThe Annals of Statistics, 2010
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)IEEE Transactions on Information Theory, 2009
- Variable selection using MM algorithmsThe Annals of Statistics, 2005
- Support-vector networksMachine Learning, 1995
- A Statistical View of Some Chemometrics Regression ToolsTechnometrics, 1993