Guarantees for Greedy Maximization of Non-submodular Functions with Applications

  title={Guarantees for Greedy Maximization of Non-submodular Functions with Applications},
  author={Andrew An Bian and Joachim M. Buhmann and Andreas Krause and Sebastian Tschiatschek},
We investigate the performance of the standard GREEDY algorithm for cardinality constrained maximization of non-submodular nondecreasing set functions. While there are strong theoretical guarantees on the performance of GREEDY for maximizing submodular functions, there are few guarantees for non-submodular ones. However, GREEDY enjoys strong empirical performance for many important non-submodular functions, e.g., the Bayesian A-optimality objective in experimental design. We prove theoretical… CONTINUE READING
Highly Cited
This paper has 30 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 23 times over the past 90 days. VIEW TWEETS
22 Citations
33 References
Similar Papers


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 33 references

Nearoptimal sensor placements in gaussian processes: Theory, efficient algorithms and empirical studies

  • Krause, Andreas, Singh, Ajit, Guestrin, Carlos
  • Journal of Machine Learning Research,
  • 2008
Highly Influential
4 Excerpts

An analysis of approximations for maximizing submodular set functions–i

  • Nemhauser, L George, Wolsey, A Laurence, Fisher, L Marshall
  • Mathematical Programming,
  • 1978
Highly Influential
3 Excerpts

Guaranteed nonconvex optimization: Submodular maximization over continuous domains

  • Bian, Andrew An, +5 authors Andreas
  • 2017

Similar Papers

Loading similar papers…