Search Results for author:
Found 2 papers, 1 papers with code
Guarantees for Greedy Maximization of Non-submodular Functions with Applications
Our guarantees are characterized by a combination of the (generalized) curvature $\alpha$ and the submodularity ratio $\gamma$.
Guaranteed Non-convex Optimization: Submodular Maximization over Continuous Domains
Submodular continuous functions are a category of (generally) non-convex/non-concave functions with a wide spectrum of applications.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
