Fetching the paper…
Reading the bibliography…
We formulate the sparse classification problem of $n$ samples with $p$ features as a binary convex optimization problem and propose a cutting-plane algorithm to solve it exactly.
Atamturk A, Gomez A (2019) Rank-one convexification for sparse regression
1901
Earlier work this paper cites.
1902
Earlier work this paper cites.
Donoho D, Tanner J (2009) Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
1906
Earlier work this paper cites.
Donoho D, Stodden V (2006) Breakdown point of model selection when the number of variables exceeds the number of observations
1921
Earlier work this paper cites.
Kelley JE Jr (1960) The cutting-plane method for solving convex programs
1960
Earlier work this paper cites.
Bertsekas DP (1982) Projected newton methods for optimization problems with simple constraints
1982
Earlier work this paper cites.
Duran MA, Grossmann IE (1986) An outer-approximation algorithm for a class of mixed-integer nonlinear programs
1986
Earlier work this paper cites.
Calamai PH, Moré JJ (1987) Projected gradient methods for linearly constrained problems
1987
Earlier work this paper cites.
Fletcher R, Leyffer S (1994) Solving mixed integer nonlinear programs by outer approximation
1994
Earlier work this paper cites.
Cortes C, Vapnik V (1995) Support-vector networks
1995
Earlier work this paper cites.
Natarajan BK (1995) Sparse approximate solutions to linear systems
1995
Earlier work this paper cites.
Tibshirani R (1996) Regression shrinkage and selection via the lasso
1996
Earlier work this paper cites.
Dash M, Liu H (1997) Feature selection for classification
1997
Earlier work this paper cites.
Vapnik V (1998) The support vector method of function estimation
1998
Earlier work this paper cites.
2001
Earlier work this paper cites.
Scholkopf B, Smola AJ (2001)
2001
Earlier work this paper cites.
Guyon I, Weston J, Barnhill S, Vapnik V (2002) Gene selection for cancer classification using support vector machines
2002
Earlier work this paper cites.
Steinwart I (2002) Support vector machines are universally consistent
2002
Earlier work this paper cites.
Boyd S, Vandenberghe L (2004)
2004
Cited alongside, same era.
Zhang T (2004) Statistical behavior and consistency of classification methods based on convex risk minimization
2004
Cited alongside, same era.
Keerthi SS, Duan KB, Shevade SK, Poo AN (2005) A fast dual algorithm for kernel logistic regression
2005
Cited alongside, same era.
Bonami P, Biegler LT, Conn AR, Cornuéjols G, Grossmann IE, Laird CD, Lee J, Lodi A, Margot F, Sawaya N, et al. (2008) An algorithmic framework for convex mixed integer nonlinear programs
2008
Cited alongside, same era.
Boufounos PT, Baraniuk RG (2008) 1-bit compressive sensing
2008
Cited alongside, same era.
Hsieh CJ, Chang KW, Lin CJ, Keerthi SS, Sundararajan S (2008) A dual coordinate descent method for large-scale linear svm
Friedman J, Hastie T, Tibshirani R (2013) GLMNet: Lasso and elastic-net regularized generalized linear models. r package version 1.9–5
2013
Later among the works it cites.
Chu BY, Ho CH, Tsai CH, Lin CY, Lin CJ (2015) Warm start for parameter selection of linear classifiers
2015
Later among the works it cites.
Dunning I, Huchette J, Lubin M (2015) Jump: A modeling language for mathematical optimization
2015
Later among the works it cites.
Lubin M, Dunning I (2015) Computing in operations research using Julia
2015
Later among the works it cites.
Pilanci M, Wainwright MJ, El Ghaoui L (2015) Sparse learning via boolean relaxations
2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2008
Cited alongside, same era.
Lin CJ, Weng RC, Keerthi SS (2008) Trust region newton method for logistic regression
2008
Cited alongside, same era.
Bach F (2009) High-dimensional non-linear variable selection through hierarchical kernel learning
2009
Cited alongside, same era.
Bertsimas D, Fertis A (2009) On the equivalence of robust optimization and regularization in statistics. Technical report, Massachusetts Institute of Technology, working paper
2009
Cited alongside, same era.
Fan J, Song R, et al. (2010) Sure independence screening in generalized linear models with np-dimensionality
2010
Cited alongside, same era.
Friedman J, Hastie T, Tibshirani R (2010) Regularization paths for generalized linear models via coordinate descent
2010
Cited alongside, same era.
Gupta A, Nowak R, Recht B (2010) Sample complexity for 1-bit compressed sensing and sparse classification
2010
Cited alongside, same era.
2015
Later among the works it cites.
Bertsimas D, King A, Mazumder R (2016) Best subset selection via a modern optimization lens
2016
Later among the works it cites.
Cramér H (2016)
2016
Later among the works it cites.
Gurobi Optimization I (2016) Gurobi optimizer reference manual. URL
2016
Later among the works it cites.
Bertsimas D, King A (2017) Logistic regression: From art to science Statistical Science
2017
Closest in time.
Fischetti M, Ljubić I, Sinnl M (2017) Redesigning benders decomposition for large-scale facility location
2017
Closest in time.
2017
Closest in time.
Scarlett J, Cevher V (2017) Limits on support recovery with probabilistic models: An information-theoretic framework
2017
Closest in time.
2018
Closest in time.
Kenney A, Chiaromonte F, Felici G (2018) Efficient and effective
2018
Closest in time.
Bertsimas D, Van Parys B, et al. (2020) Sparse high-dimensional regression: Exact scalable algorithms and phase transitions
2020
Closest in time.
Jacques L, Laska JN, Boufounos PT, Baraniuk RG (2013) Robust 1-bit compressive sensing via binary stable embeddings of sparse vectors
2082
Closest in time.