Efficient learning by directed acyclic graph for resource constrained prediction

Advances in Neural Information Processing Systems

Volumn 2015-January, Issue , 2015, Pages 2152-2160

  Wang, Joseph ^a   Trapeznikov, Kirill ^b   Saligrama, Venkatesh ^a  

^a Boston University   (United States)

^b Systems and Technology Research   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BUDGET CONTROL; COST REDUCTION; DIRECTED GRAPHS; DYNAMIC PROGRAMMING;

CLASSIFICATION SYSTEM; COMPUTATIONALLY EFFICIENT; COST-SENSITIVE LEARNING; DECISION FUNCTIONS; DIRECTED ACYCLIC GRAPH (DAG); EMPIRICAL PERFORMANCE; EMPIRICAL RISK MINIMIZATION; STATE-OF-THE-ART ALGORITHMS;

GRAPH THEORY;

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

References (26)

1. P. Bartlett, M. Jordan, and J. Mcauliffe. Convexity, Classification, and Risk Bounds. Journal of American Statistical Association, 101(473):138-156, 2006.
2. A. Beygelzimer, J. Langford, and P. Ravikumar. Multiclass classification with filter trees. 2007.
3. R. Busa-Fekete, D. Benbouzid, and B. Kégl. Fast classification using sparse decision dags. In Proceedings of the 29th International Conference on Machine Learning, 2012.
4. M. Chen, Z. Xu, K. Weinberger, O. Chapelle, and D. Kedem. Classifier cascade: Tradeoff between accuracy and feature evaluation cost. In International Conference on Artificial Intelligence and Statistics, 2012.
5. G. Dulac-Arnold, L. Denoyer, P. Preux, and P. Gallinari. Datum-wise classification: a sequential approach to sparsity. In Machine Learning and Knowledge Discovery in Databases, pages 375-390. 2011.
6. T. Gao and D. Koller. Active classification based on value of classifier. In Advances in Neural Information Processing Systems, volume 24, pages 1062-1070, 2011.
7. H. He, H. Daume III, and J. Eisner. Imitation learning by coaching. In Advances In Neural Information Processing Systems, pages 3158-3166, 2012.
8. S. Ji and L. Carin. Cost-sensitive feature acquisition and classification. Pattern Recognition, 40(5), 2007.
9. P. Kanani and P. Melville. Prediction-time active feature-value acquisition for cost-effective customer targeting. In Advances In Neural Information Processing Systems, 2008.
10. S. Karayev, M. Fritz, and T. Darrell. Dynamic feature selection for classification on a budget. In International Conference on Machine Learning: Workshop on Prediction with Sequential Models, 2013.
11. M. Kusner, W. Chen, Q. Zhou, Z. Xu, K. Weinberger, and Y. Chen. Feature-cost sensitive learning with submodular trees of classifiers. In Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014.
12. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. Van Briesen, and N. Glance. Cost-effective outbreak detection in networks. In International Conference on Knowledge Discovery and Data Mining, 2007.
13. L. Maaten, M. Chen, S. Tyree, and K. Q. Weinberger. Learning with marginalized corrupted features. In Proceedings of the 30th International Conference on Machine Learning, 2013.
14. F. Nan, J. Wang, and V. Saligrama. Feature-budgeted random forest. In Proceedings of the 32nd International Conference on Machine Learning, 2015.
15. F. Nan, J. Wang, K. Trapeznikov, and V. Saligrama. Fast margin-based cost-sensitive classification. In International Conference on Acoustics, Speech and Signal Processing, 2014.
16. G. Nemhauser, L. Wolsey, and M. Fisher. An analysis of approximations for maximizing submodular set functionsi. Mathematical Programming, 14(1):265-294, 1978.
17. V. S. Sheng and C. X. Ling. Feature value acquisition in testing: A sequential batch test algorithm. In Proceedings of the 23rd International Conference on Machine Learning, pages 809-816, 2006.
18. I. Steinwart. Consistency of support vector machines and other regularized kernel classifiers. Information Theory, IEEE Transactions on, 51(1):128-142, 2005.
19. K. Trapeznikov and V. Saligrama. Supervised sequential classification under budget constraints. In International Conference on Artificial Intelligence and Statistics, pages 581-589, 2013.
20. J. Wang, T. Bolukbasi, K. Trapeznikov, and V. Saligrama. Model selection by linear programming. In European Conference on Computer Vision, pages 647-662, 2014.
21. J. Wang and V. Saligrama. Local supervised learning through space partitioning. In Advances in Neural Information Processing Systems, pages 91-99. 2012.
22. J. Wang and V. Saligrama. Locally-linear learning machines (L3M). In Asian Conference on Machine Learning, pages 451-466, 2013.
23. J. Wang, K. Trapeznikov, and V. Saligrama. An lp for sequential learning under budgets. In International Conference on Artificial Intelligence and Statistics, pages 987-995, 2014.
24. Z. Xu, O. Chapelle, and K. Weinberger. The greedy miser: Learning under test-time budgets. In Proceedings of the 29th International Conference on Machine Learning, 2012.
25. Z. Xu, M. Kusner, M. Chen, and K. Weinberger. Cost-sensitive tree of classifiers. In Proceedings of the 30th International Conference on Machine Learning, pages 133-141, 2013.
26. C. Zhang and Z. Zhang. A Survey of Recent Advances in Face Detection. Technical report, Microsoft Research, 2010.