Fetching the paper…
Reading the bibliography…
In this paper, we review state-of-the-art methods for feature selection in statistics with an application-oriented eye.
On general minimax theorems
M. Sion · 1958
Earlier work this paper cites.
Ridge regression: Biased estimation for nonorthogonal problems
A. E. Hoerl and E. W. Kennard · 1970
Earlier work this paper cites.
Regressions by leaps and bounds
G. M. Furnival and R. W. Wilson · 1974
Earlier work this paper cites.
An outer-approximation algorithm for a class of mixed-integer nonlinear programs
M. A. Duran and I. E. Grossmann · 1986
Earlier work this paper cites.
Matching pursuits with time-frequency dictionaries
S. G. Mallat and Z. Zhang · 1993
Earlier work this paper cites.
Sparse approximate solutions to linear systems
B. K. Natarajan · 1995
Earlier work this paper cites.
Heuristics of instability and stabilization in model selection
L. Breiman et al · 1996
Earlier work this paper cites.
Regression shrinkage and selection via the lasso
R. Tibshirani · 1996
Earlier work this paper cites.
Waveshrink with firm shrinkage
H.-Y. Gao and A. G. Bruce · 1997
Earlier work this paper cites.
Uncertainty principles and ideal atomic decomposition
D. L. Donoho and X. Huo · 2001
Earlier work this paper cites.
Variable selection via nonconcave penalized likelihood and its oracle properties
J. Fan and R. Li · 2001
Earlier work this paper cites.
Gene selection for cancer classification using support vector machines
I. Guyon, J. Weston, S. Barnhill, and V. Vapnik · 2002
Earlier work this paper cites.
Least angle regression
B. Efron, T. Hastie, I. Johnstone, R. Tibshirani, et al · 2004
Earlier work this paper cites.
Regularization and variable selection via the elastic net
H. Zou and T. Hastie · 2005
Earlier work this paper cites.
Stable signal recovery from incomplete and inaccurate measurements
E. J. Candes, J. K. Romberg, and T. Tao · 2006
Earlier work this paper cites.
High-dimensional graphs and variable selection with the lasso
N. Meinshausen and P. Bühlmann · 2006
Earlier work this paper cites.
On model selection consistency of lasso
P. Zhao and B. Yu · 2006
Earlier work this paper cites.
Pathwise coordinate optimization
J. Friedman, T. Hastie, H. Höfling, R. Tibshirani, et al · 2007
Cited alongside, same era.
Liblinear: A library for large linear classification
R.-E. Fan, K.-W. Chang, C.-J. Hsieh, C.-R. Wang, and C.-J. Lin · 2008
Cited alongside, same era.
Coordinate descent algorithms for lasso penalized regression
T. T. Wu and K. Lange · 2008
Cited alongside, same era.
One-step sparse estimates in nonconcave penalized likelihood models
H. Zou and R. Li · 2008
Cited alongside, same era.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
A. Beck and M. Teboulle · 2009
Cited alongside, same era.
On the equivalence of robust optimization and regularization in statistics
D. Bertsimas and A. Fertis · 2009
Statistical Learning with Sparsity: the Lasso and Generalizations
T. Hastie, R. Tibshirani, and M. Wainwright · 2015
Later among the works it cites.
On the tightness of an sdp relaxation of k-means
T. Iguchi, D. G. Mixon, J. Peterson, and S. Villar · 2015
Later among the works it cites.
Computing in operations research using Julia
M. Lubin and I. Dunning · 2015
Later among the works it cites.
Sparse learning via boolean relaxations
M. Pilanci, M. J. Wainwright, and L. El Ghaoui · 2015
Later among the works it cites.
False discoveries occur early on the lasso path
W. Su, M. Bogdan, and E. Candes · 2015
Later among the works it cites.
Nonlinear programming, 3rd edition
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
V12. 1: User’s manual for cplex
IBM ILOG CPLEX · 2009
Cited alongside, same era.
Approximate primal solutions and rate analysis for dual subgradient methods
A. Nedić and A. Ozdaglar · 2009
Cited alongside, same era.
Robustness and regularization of support vector machines
H. Xu, C. Caramanis, and S. Mannor · 2009
Cited alongside, same era.
Sure independence screening in generalized linear models with np-dimensionality
J. Fan and R. Song · 2010
Cited alongside, same era.
Regularization paths for generalized linear models via coordinate descent
J. Friedman, T. Hastie, and R. Tibshirani · 2010
Cited alongside, same era.
Information-theoretic limits on sparse signal recovery: Dense versus sparse measurement matrices
W. Wang, M. J. Wainwright, and K. Ramchandran · 2010
Cited alongside, same era.
D. P. Bertsekas · 2016
Later among the works it cites.
Best subset selection via a modern optimization lens
D. Bertsimas, A. King, and R. Mazumder · 2016
Later among the works it cites.
Gurobi optimizer reference manual; 2016
I Gurobi Optimization · 2016
Later among the works it cites.
Data randomness makes optimization problems easier to solve?
Y. Ye · 2016
Later among the works it cites.
Logistic regression: From art to science
D. Bertsimas and A. King · 2017
Later among the works it cites.
Sparse high-dimensional regression: Exact scalable algorithms and phase transitions
D. Bertsimas and B. Van Parys · 2017
Later among the works it cites.
Sparse classification: a scalable discrete optimization perspective
D. Bertsimas, J. Pauphilet, and B. Van Parys · 2017
Later among the works it cites.
D. Gamarnik and I. Zadik · 2017
Later among the works it cites.
Extended comparisons of best subset selection, forward stepwise selection, and the lasso
T. Hastie, R. Tibshirani, and R. J. Tibshirani · 2017
Later among the works it cites.
Support recovery without incoherence: A case for nonconvex regularization
P.-L. Loh and M. J. Wainwright · 2017
Later among the works it cites.
Fast best subset selection: Coordinate descent and local combinatorial optimization algorithms
Hussein Hazimeh and Rahul Mazumder · 2018
Later among the works it cites.
Efficient and effective l _ 0 l\_0 feature selection
Ana Kenney, Francesca Chiaromonte, and Giovanni Felici · 2018
Later among the works it cites.