The Well Tempered Lasso
暂无分享,去创建一个
[1] Martin Jaggi,et al. Approximating parameterized convex optimization problems , 2010, TALG.
[2] Shang-Hua Teng,et al. Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices , 2003, SIAM J. Matrix Anal. Appl..
[3] R. Tibshirani,et al. Degrees of freedom in lasso problems , 2011, 1111.0653.
[4] M. Rudelson,et al. Non-asymptotic theory of random matrices: extreme singular values , 2010, 1003.2990.
[5] S. Rosset,et al. Piecewise linear regularized solution paths , 2007, 0708.2197.
[6] Yoram Singer,et al. Entire Relaxation Path for Maximum Entropy Problems , 2011, EMNLP.
[7] R. Tibshirani,et al. Least angle regression , 2004, math/0406456.
[8] Bodo Manthey,et al. k-Means Has Polynomial Smoothed Complexity , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[9] Shang-Hua Teng,et al. Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time , 2001, STOC '01.
[10] Julien Mairal,et al. Complexity Analysis of the Lasso Regularization Path , 2012, ICML.
[11] R. Tibshirani. Regression Shrinkage and Selection via the Lasso , 1996 .
[12] M. R. Osborne,et al. A new approach to variable selection in least squares problems , 2000 .
[13] Shang-Hua Teng,et al. Smoothed analysis: an attempt to explain the behavior of algorithms in practice , 2009, CACM.
[14] John Dunagan,et al. Smoothed analysis of the perceptron algorithm for linear programming , 2002, SODA '02.