Bibliography

Bac11

Francis Bach. Learning with submodular functions: a convex optimization perspective. arXiv preprint arXiv:1111.6453, 2011.

CZZ18

Laming Chen, Guoxin Zhang, and Hanning Zhou. Fast greedy map inference for determinantal point process to improve recommendation diversity. In Proceedings of the 32nd International Conference on Neural Information Processing Systems, 5627–5638. 2018.

DO08

Hoa Trang Dang and Karolina Owczarzak. Overview of the tac 2008 update summarization task. In TAC. 2008.

DKR13

Anirban Dasgupta, Ravi Kumar, and Sujith Ravi. Summarization through submodularity and dispersion. In ACL (1), 1014–1022. Unknown, 2013.

DA12

Jean-Yves Delort and Enrique Alfonseca. Dualsum: a topic-model based approach for update summarization. In Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics, 214–223. 2012.

Fuj05

Satoru Fujishige. Submodular functions and optimization. Elsevier, 2005.

GB11

Andrew Guillory and Jeff Bilmes. Active semi-supervised learning using submodular functions. In Uncertainty in Artificial Intelligence (UAI). Barcelona, Spain, July 2011. AUAI.

GL20

Anupam Gupta and Roie Levin. The online submodular cover problem. In ACM-SIAM Symposium on Discrete Algorithms. Unknown, 2020.

IB12

Rishabh Iyer and Jeff Bilmes. Algorithms for approximate minimization of the difference between submodular functions, with applications. Unknown, 2012.

IB15

Rishabh Iyer and Jeff Bilmes. Polyhedral aspects of submodularity, convexity and concavity. arXiv preprint arXiv:1506.07329, 2015.

IKBA21

Rishabh Iyer, Ninad Khargoankar, Jeff Bilmes, and Himanshu Asanani. Submodular combinatorial information measures with applications in machine learning. In Algorithmic Learning Theory, 722–754. PMLR, 2021.

IB13

Rishabh K Iyer and Jeff A Bilmes. Submodular optimization with submodular cover and submodular knapsack constraints. In Unknown, 2436–2444. Advances in Neural Information Processing Systems, 2013.

KKR+20

Vishal Kaushal, Suraj Kothawade, Ganesh Ramakrishnan, Jeff Bilmes, Himanshu Asnani, and Rishabh Iyer. A unified framework for generic, query-focused, privacy preserving and update summarization using submodular information measures. arXiv preprint arXiv:2010.05631, 2020.

KKR+21

Vishal Kaushal, Suraj Kothawade, Ganesh Ramakrishnan, Jeff Bilmes, and Rishabh Iyer. Prism: a unified framework of parameterized submodular information measures for targeted data subset selection and summarization. arXiv preprint arXiv:2103.00128, 2021.

KSRI20

Krishnateja Killamsetty, Durga Sivasubramanian, Ganesh Ramakrishnan, and Rishabh Iyer. Glister: generalization based data subset selection for efficient and robust learning. arXiv preprint arXiv:2012.10630, 2020.

Kra08

A Krause. Optimizing sensing: theory and applications. pittsburgh. 2008.

KG14

Andreas Krause and Daniel Golovin. Submodular function maximization. 2014.

KSG08

Andreas Krause, Ajit Singh, and Carlos Guestrin. Near-optimal sensor placements in gaussian processes: theory, efficient algorithms and empirical studies. Journal of Machine Learning Research, 9(Feb):235–284, 2008.

KT12

Alex Kulesza and Ben Taskar. Determinantal point processes for machine learning. arXiv:1207.6083, 2012.

LLZ15

Chen Li, Yang Liu, and Lin Zhao. Improving update summarization via supervised ilp and sentence reranking. In Proceedings of the 2015 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 1317–1322. 2015.

LLL12

Jingxuan Li, Lei Li, and Tao Li. Multi-document summarization via submodularity. Applied Intelligence, 37(3):420–430, 2012.

Lin12

Hui Lin. Submodularity in natural language processing: algorithms and applications. PhD thesis, Univeristy of Washington, 2012.

LB11

Hui Lin and Jeff Bilmes. A class of submodular functions for document summarization. In Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, 510–520. 2011.

Lovasz83

László Lovász. Submodular functions and convexity. In Mathematical programming the state of the art, pages 235–257. Springer, 1983.

Min78

Michel Minoux. Accelerated greedy algorithms for maximizing submodular set functions. In Optimization techniques, pages 234–243. Springer, 1978.

MF90

Pitu B Mirchandani and Richard L Francis. Discrete location theory. Unknown, 1990.

MBK+15

Baharan Mirzasoleiman, Ashwinkumar Badanidiyuru, Amin Karbasi, Jan Vondrák, and Andreas Krause. Lazier than lazy greedy. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 29. 2015.

MBL20

Baharan Mirzasoleiman, Jeff Bilmes, and Jure Leskovec. Coresets for data-efficient training of machine learning models. In International Conference on Machine Learning, 6950–6960. PMLR, 2020.

NWF78

George L Nemhauser, Laurence A Wolsey, and Marshall L Fisher. An analysis of approximations for maximizing submodular set functions—i. Mathematical Programming, 14(1):265–294, 1978.

SGS16

Aidean Sharghi, Boqing Gong, and Mubarak Shah. Query-focused extractive video summarization. In European Conference on Computer Vision, 3–19. Springer, 2016.

SLG17

Aidean Sharghi, Jacob S Laurel, and Boqing Gong. Query-focused video summarization: dataset, evaluation, and a memory network based approach. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 4788–4797. 2017.

VGVVG17

Arun Balajee Vasudevan, Michael Gygli, Anna Volokitin, and Luc Van Gool. Query-adaptive video summarization via quality-aware relevance estimation. In Proceedings of the 25th ACM international conference on Multimedia, 582–590. 2017.

WIB14

Kai Wei, Rishabh K Iyer, and Jeff A Bilmes. Fast multi-stage submodular maximization. In Unknown, 1494–1502. ICML, 2014.