Concepedia

Probabilistic Submodular Maximization in Sub-Linear Time.

Serban Stan, Morteza Zadimoghaddam, Andreas Krause, Amin Karbasi

International Conference on Machine Learning · 2017 · 21 citations · 23 references

Concepts

References

23

Exact Matrix Completion via Convex Optimization

Emmanuel J. Candès, Benjamin Recht · Foundations of Computational Mathematics · 2009 · 5.1K citations · Full text

, , +15

An analysis of approximations for maximizing submodular set functions—I

George L. Nemhauser, Laurence A. Wolsey, Marshall L. Fisher · Mathematical Programming · 1978 · 4.5K citations

, , +10

Maximizing a Monotone Submodular Function Subject to a Matroid Constraint

Gruiă Cälinescu, Chandra Chekuri, Martin Pál et al. · SIAM Journal on Computing · 2011 · 820 citations

, , +17

A Class of Submodular Functions for Document Summarization

Hui Lin, Jeff Bilmes · 2011 · 639 citations

, , +10

Near-optimal Nonmyopic Value of Information in Graphical Models

Andreas Krause, Carlos Guestrin · arXiv (Cornell University) · 2012 · 359 citations · Full text

, , +17