Anytime representation learning

30th International Conference on Machine Learning, ICML 2013

Volumn , Issue PART 3, 2013, Pages 2113-2121

  Xu, Zhixiang ^a   Kusner, Matt J ^a   Huang, Gao ^b   Weinberger, Kilian Q ^a  

^a WASHINGTON UNIVERSITY   (United States)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DIAGNOSIS; SEARCH ENGINES;

ANYTIME LEARNING; CONVENTIONAL CLASSIFIER; COST-SENSITIVE; DATA REPRESENTATIONS; E-MAIL SPAM; EVALUATION COST; FEATURE REPRESENTATION; NOVEL ALGORITHM;

LEARNING SYSTEMS;

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

References (38)

1. Bormans, J Frédéric and Shapiro, Alexander. Optimization problems with perturbations: A guided tour. SIAM review, 40(2):228-264, 1998.
2. Breiman, L. Classification and regression trees. Chapman & Hall/CRC, 1984.
3. Busa-Fekete, R., Benbouzid, D., Kégl, B., et al. Fast classification using sparse decision dags. In ICML, 2012.
4. Cambazoglu, B.B., Zaragoza, H., Chapelle, O., Chen, J., Liao, C., Zheng, Z., and Degenhardt, J. Early exit optimizations for additive machine learned ranking systems. In WSDM'3, pp. 411-420, 2010.
5. Chapelle, O. and Chang, Y. Yahoo! learning to rank challenge overview. In JMLR: Workshop and Conference Proceedings, volume 14, pp. 1-24, 2011.
6. Chapelle, O., Vapnik, V., Bousquet, O., and Mukherjee, S. Choosing multiple parameters for support vector machines. Machine Learning, 46(1):131-159, 2002. (Pubitemid 34129966)
7. Chapelle, O., Shivaswamy, P., Vadrevu, S., Weinberger, K., Zhang, Y., and Tseng, B. Boosted multi-task learning. Machine learning, 85(1):149-173, 2011.
8. Chen, M., Xu, Z., Weinberger, K. Q., and Chapelle, O. Classifier cascade for minimizing feature evaluation cost. In AISTATS, 2012.
9. Cortes, C. and Vapnik, V. Support-vector networks. Machine learning, 20(3):273-297, 1995.
10. Dekel, Ofer, Shalev-Shwartz, Shai, and Singer, Yoram. The forgetron: A kernel-based perceptron on a budget. SIAM Journal on Computing, 37(5):1342-1372, 2008.
11. Dredze, M., Gevaryahu, R., and Elias-Bachrach, A. Learning fast classifiers for image spam. In proceedings of the Conference on Email and Anti-Spam (CEAS), 2007.
12. Freund, Y. and Schapire, R. A desicion-theoretic generalization of on-line learning and an application to boosting. In Computational learning theory, pp. 23-37. Springer, 1995.
13. Friedman, J.H. Greedy function approximation: a gradient boosting machine. The Annals of Statistics, pp. 1189-1232, 2001. (Pubitemid 33405972)
14. Gao, T. and Roller, D. Active classification based on value of classifier. In NIPS, pp. 1062-1070. 2011a.
15. Gao, Tianshi and Roller, Daphne. Multiclass boosting with hinge loss based on output coding. ICML '11, pp. 569-576, 2011b.
16. Gavrila, D. Pedestrian detection from a moving vehicle. ECCV 2000, pp. 37-49, 2000.
17. Grubb, A. and Bagnell, J. A. Speedboost: Anytime prediction with uniform near-optimality. In AISTATS, 2012.
18. Grubb, A. and Bagnell, J.A. Generalized boosting algorithms for convex optimization. arXiv preprint arXiv.1105.2054, 2011.
19. Grubb, Alexander and Bagnell, J Andrew. Boosted back-propagation learning for training deep modular networks. In Proceedings of the International Conference on Machine Learning (27th ICML), 2010.
20. Kedem, Dor, Tyree, Stephen, Weinberger, Kilian Q., Sha, Fei, and Lanckriet, Gert. Non-linear metric learning. In NIPS, pp. 2582-2590. 2012.
21. Lazebnik, S., Schmid, C., and Ponce, J. Beyond bags of features: Spatial pyramid matching for recognizing natural scene categories. In CVPR, pp. 2169-2178, 2006.
22. Lefakis, L. and Fleuret, F. Joint cascade optimization using a product of boosted classifiers. In NIPS, pp. 1315-1323. 2010.
23. Li, L.J., Su, H., Xing, E.P., and Fei-Fei, L. Object bank: A high-level image representation for scene classification and semantic feature sparsification. NIPS, 2010.
24. Mohan, A., Chen, Z., and Weinberger, K. Q. Web-search ranking with initialized gradient boosted regression trees. JMLR: Workshop and Conference Proceedings, 14:77-89, 2011.
25. Petersen, K. B. and Pedersen, M. S. The matrix cookbook, Oct 2008.
26. Platt, J.C. Fast training of support vector machines using sequential minimal optimization. 1999.
27. Pujara, J., Daumé III, H., and Getoor, L. Using classifier cascades for scalable e-mail classification. In CEAS, 2011.
28. Raykar, V.C., Krishnapuram, B., and Yu, S. Designing efficient cascaded classifiers: tradeoff between accuracy and cost. In ACM SIGKDD, pp. 853-860, 2010.
29. Saberian, M. and Vasconcelos, N. Boosting classifier cascades. In NIPS, pp. 2047-2055. 2010.
30. Trzcinski, Tomasz, Christoudias, Mario, Lepetit, Vincent, and Fua, Pascal. Learning image descriptors with the boosting-trick. In NIPS, pp. 278-286. 2012.
31. Tyree, S., Weinberger, K.Q., Agrawal, K., and Paykin, J. Parallel boosted regression trees for web search ranking. In WWW, pp. 387-396. ACM, 2011.
32. Viola, P. and Jones, M.J. Robust real-time face detection. IJCV, 57(2):137-154, 2004.
33. Wang, J. and Saligrama, V. Local supervised learning through space partitioning. In NIPS, pp. 91-99, 2012.
34. Weinberger, K.Q., Dasgupta, A., Langford, J., Smola, A., and Attenberg, J. Feature hashing for large scale multi-task learning. In ICML, pp. 1113-1120, 2009.
35. Xiao, Jianxiong, Hays, James, Ehinger, Krista A, Oliva, Aude, and Torralba, Antonio. Sun database: Large-scale scene recognition from abbey to zoo. In CVPR, pp. 3485-3492. IEEE, 2010.
36. Xu, Z., Weinberger, K.Q., and Chapelle, O. The greedy miser: Learning under test-time budgets. In ICML, pp. 1175-1182, 2012.
37. Xu, Zhixiang, Kusner, Matt J., Weinberger, Kilian Q., and Chen, Minmin. Cost-sensitive tree of classifiers. In Dasgupta, Sanjoy and McAllester, David (eds.), ICML '13, pp. to appear, 2013.
38. 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 NIPS, pp. 1697-1704. Cambridge, MA, 2008.