Gradient LASSO for feature selection

Proceedings, Twenty-First International Conference on Machine Learning, ICML 2004

Volumn , Issue , 2004, Pages 473-480

  Kim, Yongdai ^a   Kim, Jinseog ^a  

^a Seoul National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; FUNCTIONS; LEARNING SYSTEMS; MATHEMATICAL MODELS; NONLINEAR PROGRAMMING; PROBLEM SOLVING;

BOOSTING ALGORITHMS; LEAST ABSOLUTE SHRINKAGE AND SELECTION OPERATOR (LASSO); LINEAR COMBINATIONS; QUADRATIC PROGRAMS (QP);

MATHEMATICAL OPERATORS;

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

References (19)

1. Bakin, S. (1999). Adaptive regression and model selection in data mining problem. Doctoral dissertation, Australian National University, Australia.
2. Barron, A. R. (1993). A universal approximation bounds for superpositions of a sigmoidal function. IEEE Trans. Inform. Theory, 39, 930-945.
3. Chen, S. S., Donoho, D. L., & Saunders, M. A. (1999). Atomic decomposition by basis pursuit. SIAM Journal on Scientific Computing, 20, 33-61.
4. Efron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004). Least angle regression. Annals of Statistics.
5. Freund, Y., & Schapire, R. (1997). A decisiontheoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55, 119-139.
6. Friedman, J. (2001). Greedy function approximation : a gradient boosting machine. Annals of Statistics, 29, 1189-1232.
7. Friedman, J., Hastie, T., & Tibshirani, R. (2000). Additive logistic regression: A statistical view of boosting. Annals of Statistics, 28, 337-374.
8. Grandvalet, Y., & Canu, S. (1999). Outcomes of the equivalence of adaptive ridge with least absolute shrinkage. In M. Kearns, S. Solla and D. Cohn (Eds.), Advances in neural information processing systems, vol. 11, 445-451. MIT press.
9. Gunn, S. R., & Kandola, J. S. (2002). Structural modelling with sparse kernels. Machine Learning, 48, 115-136.
10. Jones, L. K. (1992). A simple lemma on greedy approximation in Hubert space and convergence rates for projection pursuit regression and neural network training. Annals of Statistics, 20, 608-613.
11. Kimeldorf, G., & Wahba, G. (1972). Some results on Tchebychffian spline functions, J. Math. Anal. Applic., 33, 82-95.
12. Knight, K., & Fu, W. J. (2000). Asymptotics for lassotype estimators. Annals of Statistics, 28, 1356-1378.
13. Lokhorst, J., Turlach, B. A., & Venables, W. N. (1999). Lasso2*: An s-plus library to solve regression problems while imposing an 11 constraint on the parameters.
14. Lugosi, G., & Vayatis, N. (2004). On the bayes risk consistency of regularized boosting methods. Annals of Statistics.
15. Mason, L., Baxter, L., Bartlett, P., & Frean, M. (2000). Functional gradient techniques for combining hypotheses. In A. J. Smola, P. L. Bartlett, B. Scholkopf and D. Schuurmans (Eds.), Advances in large margin classifiers. Cambridge: MIT press.
16. Osborne, M. R., Presnell, B., & Turlach, B. A. (2000). A new approach to variable selection in least squares problems. IMA Journal of Numerical Analysis, 20, 389-403.
17. Perkins, S., Lacker, K., & Theiler, J. (2003). Grafting: Fast, incremetal feature selection by gradient descent in function space. Journal of Machine Learnign Research, 3, 1333-1356.
18. Tibshirani, R. (1996). Regression shrinkage and selection via the lasso. J.R. Statist. Soc. (B), 58, 267-288.
19. Zhang, H., Wahba, G., abd M. Voelker, Y. L., Ferris, M., Klein, R., & Klein, B. (2003). Variable selection and model building via likelihood basis pursuit (Technical Report 1059r). Department of Statistics, University of Wisconsin, Madison, WI.