Fast semidifferential-based submodular function optimization

30th International Conference on Machine Learning, ICML 2013

Volumn , Issue PART 3, 2013, Pages 1892-1900

  Iyer, Rishabh ^a   Jegelka, Stefanie ^b   Bilmes, Jeff ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LEARNING SYSTEMS;

EMPIRICAL EXPERIMENTS; MAXIMIZATION ALGORITHM; SUBMODULAR; SUBMODULAR FUNCTIONS; SUBMODULAR OPTIMIZATIONS; SUBMODULARITY;

CONSTRAINED OPTIMIZATION;

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

References (40)

1. Averbakh, I. and Berman, O. Categorized bottleneck-minisum path problems on networks. Operations Research Letters, 16:291-297, 1994.
2. Bach, F. Learning with Submodular functions: A convex Optimization Perspective. Arxiv, 2011.
3. Boykov, Y. and Jolly, M.P. Interactive graph cuts for optimal boundary and region segmentation of objects in n-d images. In ICCV, 2001.
4. Buchbinder, N., Feldman, M., Naor, J., and Schwartz, R. A tight (1/2) linear-time approximation to unconstrained submodular maximization. In FOCS, 2012.
5. Conforti, M. and Cornuejols, G. Submodular set functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the Rado-Edmonds theorem. Discrete Applied Mathematics, 7(3):251-274, 1984.
6. Delong, A., Veksler, O., Osokin, A., and Boykov, Y. Minimizing sparse high-order energies by submodular vertex-cover. In In NIPS, 2012.
7. Feige, U., Mirrokni, V., and Vondrák, J. Maximizing non-monotone submodular functions. SIAM J. COMPUT., 40(4):1133-1155, 2007.
8. Fujishige, S. Submodular functions and optimization, volume 58. Elsevier Science, 2005.
9. Fujishige, S. and Isotani, S. A submodular function minimization algorithm based on the minimum-norm base. Pacific Journal of Optimization, 7:3-17, 2011.
10. Garofolo, J., Lamel, L., Fisher, W., Fiscus, J., Pallet, D., and Dahlgren, N. Timit, acoustic-phonetic continuous speech corpus. In DARPA, 1993.
11. Goel, G., Karande, C., Tripathi, P., and Wang, L. Approximability of combinatorial problems with multi-agent submodular cost functions. In FOCS, 2009.
12. Goemans, M.X., Harvey, N.J.A., Iwata, S., and Mirrokni, V. Approximating submodular functions everywhere. In SODA, pp. 535-544, 2009.
13. Goldengorin, B., Tijssen, G.A., and Tso, M. The maximization of submodular functions: Old and new proofs for the correctness of the dichotomy algorithm. University of Groningen, 1999.
14. Hunter, D.R. and Lange, K. A tutorial on MM algorithms. The American Statistician, 2004.
15. Iwata, S. and Nagano, K. Submodular function minimization under covering constraints. In In FOCS, pp. 671-680. IEEE, 2009.
16. Iyer, R. and Bilmes, J. The submodular Bregman and Lovász-Bregman divergences with applications. In NIPS, 2012a.
17. Iyer, R. and Bilmes, J. Algorithms for approximate minimization of the difference between submodular functions, with applications. In UAI, 2012b.
18. Iyer, R., Jegelka, S., and Bilmes, J. Mirror descent like algorithms for submodular optimization. NIPS Workshop on Discrete Optimization in Machine Learning (DISCML), 2012.
19. Iyer, R., Jegelka, S., and Bilmes, J. Fast Semidifferential-based Submodular Function Optimization : Extended Version, 2013.
20. Jegelka, S. and Bilmes, J. A. Approximation bounds for inference using cooperative cuts. In ICML, 2011a.
21. Jegelka, S. and Bilmes, J. A. Submodularity beyond submodular energies: coupling edges in graph cuts. In CVPR, 2011b.
22. Jegelka, S., Lin, H., and Bilmes, J. On fast approximate submodular minimization. In NIPS, 2011.
23. Krause, A. SFO: A toolbox for submodular function optimization. JMLR, 11:1141-1144, 2010.
24. Krause, A., Singh, A., and Guestrin, C. Near-optimal sensor placements in Gaussian processes: Theory, efficient algorithms and empirical studies. JMLR, 9: 235-284, 2008. (Pubitemid 351469021)
25. Kulesza, A. and Taskar, B. Determinantal point processes for machine learning. arXiv preprint arXiv:1207.6083, 2012.
26. Lin, H. and Bilmes, J. How to select a good training-data subset for transcription: Submodular active selection for sequences. In Interspeech, 2009.
27. Lin, H. and Bilmes, J. Optimal selection of limited vocabulary speech corpora. In Interspeech, 2011a.
28. Lin, H. and Bilmes, J. A class of submodular functions for document summarization. In ACL, 2011b.
29. McCormick, S Thomas. Submodular function minimization. Discrete Optimization, 12:321-391, 2005.
30. McLachlan, G.J. and Krishnan, T. The EM algorithm and extensions. New York, 1997.
31. Nagano, K., Kawahara, Y., and Iwata, S. Minimum average cost clustering. In NIPS, 2010.
32. Narasimhan, M. and Bilmes, J. A submodular-supermodular procedure with applications to discriminative structure learning. In UAI, 2005.
33. Narasimhan, M., Jojic, N., and Bilmes, J. Q-clustering. NIPS, 18:979, 2006.
34. Nemhauser, G.L., Wolsey, L.A., and Fisher, M.L. An analysis of approximations for maximizing submodular set functions - i. Mathematical Programming, 14(1):265-294, 1978.
35. Orlin, J.B. A faster strongly polynomial time algorithm for submodular function minimization. Mathematical Programming, 118(2):237-251, 2009.
36. Rousu, J. and Shawe-Taylor, J. Efficient computation of gapped substring kernels on large alphabets. Journal of Machine Learning Research, 6(2):1323, 2006.
37. Stobbe, P. and Krause, A. Efficient minimization of decomposable submodular functions. In NIPS, 2010.
38. Svitkina, Z. and Fleischer, L. Submodular approximation: Sampling-based algorithms and lower bounds. In FOCS, pp. 697-706, 2008.
39. Wan, P.-J., Calinescu, G., Li, X.-Y., and Frieder, O. Minimum-energy broadcasting in static ad hoc wireless networks. Wireless Networks, 8:607-617, 2002. (Pubitemid 35327513)
40. Yuille, A.L. and Rangarajan, A. The concave-convex procedure (CCCP). In NIPS, 2002.