2017
Guaranteed Non-convex Optimization: Submodular Maximization over Continuous Domains
AISTATS 2017poster
Submodular continuous functions are a category of (generally) non-convex/non-concave functions with a wide spectrum of applications. We characterize these functions and demonstrate that they can be maximized efficiently with approximation guarantees. Specifically, i) We introduce the weak DR proper…