Adaptive Forward-Backward Greedy Algorithm for Sparse Learning with Linear Models
暂无分享,去创建一个
[1] H. P.. Annales de l'Institut Henri Poincaré , 1931, Nature.
[2] Yoram Bresler,et al. On the Optimality of the Backward Greedy Algorithm for the Subset Selection Problem , 2000, SIAM J. Matrix Anal. Appl..
[3] Trevor Hastie,et al. The Elements of Statistical Learning , 2001 .
[4] R. Tibshirani,et al. Least angle regression , 2004, math/0406456.
[5] Joel A. Tropp,et al. Greed is good: algorithmic results for sparse approximation , 2004, IEEE Transactions on Information Theory.
[6] Peng Zhao,et al. On Model Selection Consistency of Lasso , 2006, J. Mach. Learn. Res..
[7] A. Tsybakov,et al. Sparsity oracle inequalities for the Lasso , 2007, 0705.3308.
[8] Cun-Hui Zhang,et al. The sparsity and bias of the Lasso selection in high-dimensional linear regression , 2008, 0808.0967.
[9] Tong Zhang. Some sharp performance bounds for least squares regression with L1 regularization , 2009, 0908.2869.
[10] V. Koltchinskii. Sparsity in penalized empirical risk minimization , 2009 .
[11] P. Bickel,et al. SIMULTANEOUS ANALYSIS OF LASSO AND DANTZIG SELECTOR , 2008, 0801.1095.