Generalized boosting algorithms for convex optimization

Proceedings of the 28th International Conference on Machine Learning, ICML 2011

Volumn , Issue , 2011, Pages 1209-1216

  Grubb, Alexander ^a   Bagnell, J Andrew ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOSTING ALGORITHM; BOOSTING APPROACH; CONVEX OBJECTIVES; GRADIENT BASED; GRADIENT BOOSTING; LOSS FUNCTIONS; NON-SMOOTH; STRONG CONVERGENCE; WEAK LEARNER;

ALGORITHMS; CONVEX OPTIMIZATION; LEARNING SYSTEMS;

ADAPTIVE BOOSTING;

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

References (18)

1. Boyd, S. and vandenberghe, L. Convex Optimization. Cambridge University Press, New York, NY, USA, 2004.
2. Bradley, D. M. Learning in Modular Systems. PhD thesis, The Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, USA, 2009.
3. Crammer, K. and Singer, Y. On the algorithmic implementation of multiclass kernel-based vector machines. J. Mach. Learn. Res., 2:265-292, March 2002.
4. Frank, A. and Asuncion, A. UCI machine learning repository, 2010. URL http://archive.ics.uci.edu/ml.
5. Frank, M. and Wolfe, P. An algorithm for quadratic programming. Naval Research Logistics Quarterly, 3:95-110, 1956.
6. Freund, Y. and Schapire, R. E. A decision-theoretic generalization of on-line learning and an application to boosting, Journal of Computer and System Sciences, 55(1):119-139, 1997. (Pubitemid 127433398)
7. Freund, Y., Iyer, R., Schapire, R. E., and Singer, Y. An efficient boosting algorithm for combining preferences. J. Mach. Learn. Res., 4:933-969, 2003.
8. Friedman, J. H. Greedy function approximation: A gradient boosting machine. Annals of Statistics, 29:1189-1232, 2000. (Pubitemid 33405972)
9. Grubb, A. and Bagnell, J. A. Generalized boosting algorithms for convex optimization (with proofs). arXiv, arXiv:1105.2054 [cs.LG], 2011.
10. Hazan, E., Kalai, A., Kale, S., and Agarwal, A. Logarithmic regret algorithms for online convex optimization. In Proceedings of the 19th Annual Conference on Learning Theory, pp. 499-513, 2006.
11. Mason, L., Baxter, J., Bartlett, P. L., and Frean, M. Functional gradient techniques for combining hypotheses. In Advances in Large Margin Classifiers. MIT Press, 1999.
12. Mukherjee, I. and Schapire, R. E. A theory of multiclass boosting. In Advances in Neural Information Processing Systems 22, Cambridge, MA, 2010. MIT Press.
13. Ratliff, N. Learning to Search: Structured Prediction Techniques for Imitation Learning. PhD thesis, The Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, USA, 2009.
14. Ratliff, N., Silver, D., and Bagnell, J. A. Learning to search: Functional gradient techniques for imitation learning. Autonomous Robots, 27(1):25-53, July 2009.
15. Schapire, R. E. The boosting approach to machine learning: An overview. In MSRI Workshop on Nonlinear Estimation and Classification, 2002.
16. Sutskever, I. A simpler unified analysis of budget perceptrons. In Proceedings of the 26th Annual International Conference on Machine Learning, pp. 985-992, New York, NY, USA, 2009. ACM.
17. Zheng, Z., Zha, H., Zhang, T., Chapelle, O., Chen, K., and Sun, G. A general boosting method and its application to learning ranking functions for web search. In Advances in Neural Information Processing Systems 19, Cambridge, MA, 2007. MIT Press.
18. Zinkevich, M. Online convex programming and generalized infinitesimal gradient ascent. In Proceedings of the 20th International Conference on Machine Learning, 2003.