Fast multi-stage submodular maximization

31st International Conference on Machine Learning, ICML 2014

Volumn 4, Issue , 2014, Pages 3360-3368

  Wei, Kai ^a   Iyer, Rishabh ^a   Bilmes, Jeff ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; FUNCTION EVALUATION; LEARNING SYSTEMS;

ALGORITHMIC FRAMEWORK; DISTRIBUTIVE ALGORITHMS; LARGE-SCALE MACHINE LEARNING; MODULAR FUNCTIONS; PERFORMANCE GUARANTEES; REAL-WORLD PROBLEM; SUBMODULAR FUNCTIONS; SURROGATE FUNCTION;

ALGORITHMS;

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

References (34)

1. A. Badanidiyuru and J. Vondrak. Fast algorithms for maximizing sub modular functions. In SODA, 2014.
2. K. S. Balagani and V. V. Phoha. On the feature selection criterion based on an approximation of multidimensional mutual information. PAMI, IEEE Transactions, 2010.
3. A. Beygelzimer, S. Kakade, and J. Langford. Cover trees for nearest neighbor. In ICML, 2006.
4. F. Chierichetti, R. Kumar, and A. Tomkins. Max-cover in Map- Reduce. In WWW, 2010.
5. M. Conforti and G. Cornuejols. Sub modular set functions, ma- Troids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem. Discrete Applied Mathematics, 1984.
6. U. Feige. A threshold of In n for approximating set cover. JACM, 1998.
7. S. Fujishige. Sub modular functions and optimization, volume 58. Elsevier Science, 2005.
8. R. Iyer and J. Bilmes. Algorithms for approximate minimization of the difference between sub modular functions, with applications. In UAI, 2012.
9. R. Iyer and J. Bilmes. Sub modular optimization with sub modular cover and sub modular knapsack constraints. In NIPS, 2013.
10. R. Iyer, S. Jegelka, and J. Bilmes. Curvature and Optimal Algorithms for Learning and Minimizing Sub modular Functions. NIPS, 2013a.
11. R. Iyer, S. Jegelka, and J. Bilmes. Fast semi differential based sub modular function optimization. In ICML, 2013b.
12. D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of influence through a social network. In KDD, 2003.
13. S. King, C. Bartels, and J. Bilmes. SVitch board 1: Small vocabulary tasks from switchboard 1. In European Conf. on Speech Communication and Technology (Eurospeech), Lisbon, Portugal, September 2005.
14. V. Kolmogorov and R. Zabih. What energy functions can be minimized via graph cuts? IEEE TPAMI, 26(2): 147-159, 2004.
15. A. Krause and C. Guestrin. Near-optimal non myopic value of information in graphical models. In UAI, 2005.
16. A. Krause, A. Singh, and C. Guestrin. Near-optimal sensor placements in Gaussian processes: Theory, efficient algorithms and empirical studies. JMLR, 9:235-284, 2008.
17. A. Kulesza and B. Taskar. Determinantal point processes for machine learning. Foundations and Trends in Machine Learning, 5(2-3): 123-286, 2012.
18. R. Kumar, B. Moseley, S. Vassilvitskii, and A. Vattani. Fast greedy algorithms in map reduce and streaming. In SPAA, 2013.
19. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. Van Briesen, and N. Glance. Cost-effective outbreak detection in networks. In SIGKDD, 2007.
20. H. Lin and J. Bilmes. How to select a good training-data subset for transcription: Sub modular active selection for sequences. In Inter speech, 2009.
21. H. Lin and J. Bilmes. A class of sub modular functions for document summarization. In ACL, 2011.
22. H. Lin and J. Bilmes. Learning mixtures of sub modular shells with application to document summarization. In UAI, 2012.
23. Y. Liu, K. Wei, K. Kirchhoff, Y. Song, and J. Bilmes. Sub modular feature selection for high-dimensional acoustic score spaces. In ICASSP, 2013.
24. M. Minoux. Accelerated greedy algorithms for maximizing sub- modular set functions. Optimization Techniques, 1978.
25. B. Mirzasoleiman, A. Karbasi, R. Sarkar, and A. Krause. Distributed sub modular maximization: Identifying representative elements in massive data. In NIPS, 2013.
26. Nemhauser, L. Wolsey, and M. Fisher. An analysis of approximations for maximizing sub modular set functions-i. Mathematical Programming, (1), 1978.
27. Peng, F. Long, and C. Ding. Feature selection based on mutual information criteria of max-dependency, max-relevance, and min-redundancy. PAMI, IEEE Transactions, 2005.
28. Y. Singer. How to win friends and influence people, truthfully: Influence maximization mechanisms for social networks. In WSDM. ACM, 2012.
29. P. Stobbe and A. Krause. Efficient minimization of decomposable sub modular functions. In NIPS, 2010.
30. K. Wei, Y. Liu, K. Kirchhoff, and J. Bilmes. Using document summarization techniques for speech data subset selection. In NAACUHLT, 2013.
31. K. Wei, R. Iyer, and J. Bilmes. Fast multi-stage sub modular maximization: Extended version. 2014a.
32. K. Wei, Y. Liu, K. Kirchhoff, C. Bartels, and J. Bilmes. Sub modular subset selection for large-scale speech training data. In ICASSP, 2014b.
33. K. Wei, Y. Liu, K. Kirchhoff, and J. Bilmes. Unsupervised sub- modular subset selection for speech data. In ICASSP, 2014c.
34. Y. Wu, R. Zhang, and A. Rudnicky. Data selection for speech recognition. In ASRU, 2007.