Complexity analysis of the lasso regularization path

Proceedings of the 29th International Conference on Machine Learning, ICML 2012

Volumn 1, Issue , 2012, Pages 353-360

  Mairal, Julien ^a   Yu, Bin ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE ANALYSIS; COMPLEXITY ANALYSIS; DUALITY GAP; LINEAR SEGMENTS; PIECEWISE LINEAR; REGULARIZATION PATHS; WORST-CASE COMPLEXITY;

PIECEWISE LINEAR TECHNIQUES;

LEARNING SYSTEMS;

EID: 84867135375     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Beck, A. and Teboulle, M. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci., 2(1):183-202, 2009.
2. Borwein, J. M. and Lewis, A. S. Convex analysis and nonlinear optimization: theory and examples. Springer, 2006.
3. Dantzig, G. B. Maximization of a linear function of variables subject to linear inequalities. In Koopmans, T.C. (ed.), Activity Analysis of Production and Allocation, pp. 339-347. Wiley, New York, 1951.
4. Efron, B., Hastie, T., Johnstone, I., and Tibshirani, R. Least angle regression. Ann. Stat., 32(2):407-499, 2004.
5. Fu, W. J. Penalized regressions: The bridge versus the Lasso. J. Comput. Graph. Stat., 7(3):397-416, 1998.
6. Fuchs, J. J. Recovery of exact sparse representations in the presence of bounded noise. IEEE T. Inform. Theory., 51(10):3601-3608, 2005.
7. Gärtner, B., Jaggi, M., and Maria, C. An exponential lower bound on the complexity of regularization paths. preprint arXiv:0903.4817v2, 2010.
8. Giesen, J., Jaggi, M., and Laue, S. Approximating parameterized convex optimization problems. In Algorithms - ESA, Lectures Notes Comp. Sci. 2010.
9. Hastie, T., Rosset, S., Tibshirani, R., and Zhu, J. The entire regularization path for the support vector machine. J. Mach. Learn. Res., 5:1391-1415, 2004.
10. Jaggi, M. Sparse Convex Optimization Methods for Machine Learning. PhD thesis, ETH Zürich, 2011.
11. Klee, V. and Minty, G. J. How good is the simplex algorithm? In Shisha, O. (ed.), Inequalities, volume III, pp. 159-175. Academic Press, New York, 1972.
12. Markowitz, H. Portfolio selection. J. Financ., 7(1):77-91, 1952.
13. Osborne, M., Presnell, B., and Turlach, B. A new approach to variable selection in least squares problems. IMA J. Numer. Anal., 20(3):389-403, 2000.
14. Ritter, K. Ein verfahren zur lösung parameterabhängiger, nichtlinearer maximum-probleme. Math. Method Oper. Res., 6(4):149-166, 1962.
15. Rosset, S. and Zhu, J. Piecewise linear regularized solution paths. Ann. Stat., 35(3):1012-1030, 2007.
16. Tibshirani, R. Regression shrinkage and selection via the Lasso. J. Roy. Stat. Soc. B, 58(1):267-288, 1996.