This is the authors' abstract. We don't add key points for this paper.
Submodular continuous functions are a category of (generally)-convex/non-concave functions with a wide spectrum of applications. We these functions and demonstrate that they can be maximized with approximation guarantees. Specifically, i) We introduce the DR property that gives a unified characterization of submodularity for all, integer-lattice and continuous functions; ii) for maximizing monotone-submodular continuous functions under general down-closed convex, we propose a Frank-Wolfe variant with $(1-1/e)$ approximation, and sub-linear convergence rate; iii) for maximizing general-monotone submodular continuous functions subject to box constraints, we a DoubleGreedy algorithm with $1/3$ approximation guarantee. Submodular functions naturally find applications in various real-world, including influence and revenue maximization with continuous, sensor energy management, multi-resolution data summarization, location, etc. Experimental results show that the proposed algorithms generate superior solutions compared to baseline algorithms.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Bian et al. (2017) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: