Extended Comparisons of Best Subset Selection, Forward Stepwise Selection, and the Lasso
暂无分享,去创建一个
[1] N. Draper,et al. Applied Regression Analysis , 1966 .
[2] R. R. Hocking,et al. Selection of the Best Subset in Regression Analysis , 1967 .
[3] M. Kendall,et al. The discarding of variables in multivariate analysis. , 1967, Biometrika.
[4] Stéphane Mallat,et al. Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..
[5] Zhifeng Zhang,et al. Adaptive time-frequency decompositions with matching pursuit , 1994, Defense, Security, and Sensing.
[6] Balas K. Natarajan,et al. Sparse Approximate Solutions to Linear Systems , 1995, SIAM J. Comput..
[7] R. Tibshirani. Regression Shrinkage and Selection via the Lasso , 1996 .
[8] Michael A. Saunders,et al. Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..
[9] George M. Furnival,et al. Regressions by leaps and bounds , 2000 .
[10] Jianqing Fan,et al. Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties , 2001 .
[11] R. Tibshirani,et al. Least angle regression , 2004, math/0406456.
[12] R. Tibshirani,et al. On the “degrees of freedom” of the lasso , 2007, 0712.0881.
[13] Terence Tao,et al. The Dantzig selector: Statistical estimation when P is much larger than n , 2005, math/0506081.
[14] R. Tibshirani,et al. PATHWISE COORDINATE OPTIMIZATION , 2007, 0708.1485.
[15] Nicolai Meinshausen,et al. Relaxed Lasso , 2007, Comput. Stat. Data Anal..
[16] A. Belloni,et al. Square-Root Lasso: Pivotal Recovery of Sparse Signals via Conic Programming , 2010, 1009.5689.
[17] Trevor Hastie,et al. Regularization Paths for Generalized Linear Models via Coordinate Descent. , 2010, Journal of statistical software.
[18] Cun-Hui Zhang. Nearly unbiased variable selection under minimax concave penalty , 2010, 1002.4734.
[19] Ashutosh Kumar Singh,et al. The Elements of Statistical Learning: Data Mining, Inference, and Prediction , 2010 .
[20] Gareth M. James,et al. Improved variable selection with Forward-Lasso adaptive shrinkage , 2011, 1104.3390.
[21] T. Hastie,et al. SparseNet: Coordinate Descent With Nonconvex Penalties , 2011, Journal of the American Statistical Association.
[22] R. Tibshirani,et al. Strong rules for discarding predictors in lasso‐type problems , 2010, Journal of the Royal Statistical Society. Series B, Statistical methodology.
[23] R. Tibshirani,et al. Degrees of freedom in lasso problems , 2011, 1111.0653.
[24] R. Tibshirani. The Lasso Problem and Uniqueness , 2012, 1206.0313.
[25] Saharon Rosset,et al. When does more regularization imply fewer degrees of freedom? Sufficient conditions and counterexamples , 2014 .
[26] D. Bertsimas,et al. Best Subset Selection via a Modern Optimization Lens , 2015, 1507.03133.
[27] A. U.S.,et al. Effective degrees of freedom : a flawed metaphor , 2015 .