Submodular meets structured: Finding diverse subsets in exponentially-large structured item sets

Advances in Neural Information Processing Systems

Volumn 3, Issue January, 2014, Pages 2645-2653

  Prasad, Adarsh ^a   Jegelka, Stefanie ^b   Batra, Dhruv ^c  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; HIGH LEVEL LANGUAGES; INFORMATION SCIENCE;

DIVERSITY FUNCTION; GREEDY ALGORITHMS; HIGH-ORDER POTENTIALS; NATURAL LANGUAGE PROCESSING; ROBUST PREDICTIONS; STRUCTURED OUTPUT SPACES; STRUCTURED PREDICTION; SUBMODULAR FUNCTIONS;

NATURAL LANGUAGE PROCESSING SYSTEMS;

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

References (34)

1. D. Batra. An Efficient Message-Passing Algorithm for the M-Best MAP Problem. In UAI, 2012.
2. D. Batra, P. Yadollahpour, A. Guzman-Rivera, and G. Shakhnarovich. Diverse M-Best Solutions in Markov Random Fields. In ECCV, 2012.
3. Y. Boykov, O. Veksler, and R. Zabih. Efficient approximate energy minimization via graph cuts. PAMI, 20(12):1222-1239, 2001.
4. N. Buchbinder, M. Feldman, J. Naor, and R. Schwartz. A tight (1/2) linear-time approximation to unconstrained submodular maximization. In FOCS, 2012.
5. J. Carbonell and J. Goldstein. The use of MMR, diversity-based reranking for reordering documents and producing summaries. In Proc. 21st annual international ACM SIGIR conference on Research and Development in Information Retrieval, SIGIR '98, pages 335-336, 1998.
6. J. Carreira, R. Caseiro, J. Batista, and C. Sminchisescu. Semantic segmentation with second-order pooling. In ECCV, pages 430-443, 2012.
7. C. Chen, V. Kolmogorov, Y. Zhu, D. Metaxas, and C. H. Lampert. Computing the m most probable modes of a graphical model. In AISTATS, 2013.
8. C. Chen, H. Liu, D. Metaxas, and T. Zhao. Mode estimation for high dimensional discrete tree graphical models. In NIPS, 2014.
9. A. Delong, A. Osokin, H. N. Isack, and Y. Boykov. Fast approximate energy minimization with label costs. In CVPR, pages 2173-2180, 2010.
10. D. Dey, T. Liu, M. Hebert, and J. A. Bagnell. Contextual sequence prediction with application to control library optimization. In Robotics Science and Systems (RSS), 2012.
11. M. Everingham, L. V. Gool, C. K. I. Williams, J. Winn, and A. Zisserman. The PASCAL Visual Object Classes Challenge 2012 (VOC2012).
12. U. Feige, V. S. Mirrokni, and J. Vondrak. Maximizing non-monotone submodular functions. In FOCS, 2007. ISBN 0-7695-3010-9.
13. P. Goundan and A. Schulz. Revisiting the greedy approach to submodular set function maximization. Manuscript, 2009.
14. A. Guzman-Rivera, D. Batra, and P. Kohli. Multiple Choice Learning: Learning to Produce Multiple Structured Outputs. In Proc. NIPS, 2012.
15. A. Guzman-Rivera, P. Kohli, D. Batra, and R. Rutenbar. Efficiently enforcing diversity in multi-output structured prediction. In AISTATS, 2014.
16. S. Jegelka and J. Bilmes. Submodularity beyond submodular energies: Coupling edges in graph cuts. In CVPR, 2011.
17. D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of influence through a social network. In ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD), 2003.
18. P. Kohli and M. P. Kumar. Energy minimization for linear envelope MRFs. In CVPR, 2010.
19. P. Kohli, A. Osokin, and S. Jegelka. A principled deep random field model for image segmentation. In CVPR, 2013.
20. V. Kolmogorov and R. Zabih. What energy functions can be minimized via graph cuts? PAMI, 26(2): 147-159, 2004.
21. A. Krause and S. Jegelka. Submodularity in machine learning: New directions. ICML Tutorial, 2013.
22. 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.
23. A. Kulesza and B. Taskar. Structured determinantal point processes. In Proc. NIPS, 2010.
24. J. D. Lafferty, A. McCallum, and F. C. N. Pereira. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In ICML, 2001.
25. Y. LeCun, S. Chopra, R. Hadsell, M. Ranzato, and F. Huang. A tutorial on energy-based learning. In Predicting Structured Data. MIT Press, 2006.
26. H. Lin and J. Bilmes. A class of submodular functions for document summarization. In ACL, 2011.
27. G. Nemhauser, L. Wolsey, and M. Fisher. An analysis of approximations for maximizing submodular set functions. Mathematical Programming, 14(1):265-294, 1978.
28. D. Park and D. Ramanan. N-best maximal decoders for part models. In ICCV, 2011.
29. M. Streeter and D. Golovin. An online algorithm for maximizing submodular functions. In NIPS, 2008.
30. D. Tarlow, I. E. Givoni, and R. S. Zemel. HOP-MAP: Efficient message passing with high order potentials. In AISTATS, pages 812-819, 2010.
31. B. Taskar, C. Guestrin, and D. Koller. Max-Margin Markov networks. In NIPS, 2003.
32. I. Tsochantaridis, T. Joachims, T. Hofmann, and Y. Altun. Large margin methods for structured and interdependent output variables. JMLR, 6:1453-1484, 2005.
33. P. Viola and M. J. Jones. Robust real-time face detection. Int. J. Comput. Vision, 57(2):137-154, May 2004. ISSN 0920-5691.
34. C. Yanover and Y. Weiss. Finding the m most probable configurations using loopy belief propagation. In NIPS, 2003.