Optimal approximation for unconstrained non-submodular minimization

v1v2v3v4 (latest)

Optimal approximation for unconstrained non-submodular minimization

29 May 2019

Marwa El Halabi

Stefanie Jegelka

ArXiv (abs)PDF HTML

Papers citing "Optimal approximation for unconstrained non-submodular minimization"

7 / 7 papers shown

Title
Gradient Methods for Submodular Maximization Hamed Hassani Mahdi Soltanolkotabi Amin Karbasi 41 133 0 13 Aug 2017
Guarantees for Greedy Maximization of Non-submodular Functions with Applications Yatao Bian J. M. Buhmann Andreas Krause Sebastian Tschiatschek 59 237 0 06 Mar 2017
Truncated Variance Reduction: A Unified Approach to Bayesian Optimization and Level-Set Estimation Ilija Bogunovic Jonathan Scarlett Andreas Krause Volkan Cevher 81 91 0 24 Oct 2016
Algorithms for Approximate Minimization of the Difference Between Submodular Functions, with Applications Rishabh K. Iyer J. Bilmes 61 157 0 09 Aug 2014
Convex Optimization: Algorithms and Complexity Sébastien Bubeck 82 111 0 20 May 2014
Curvature and Optimal Algorithms for Learning and Minimizing Submodular Functions Rishabh K. Iyer Stefanie Jegelka J. Bilmes 75 113 0 08 Nov 2013
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection Abhimanyu Das David Kempe 199 484 0 19 Feb 2011