Search Results for author:
Found 3 papers, 2 papers with code
Online Submodular Maximization via Online Convex Optimization
We study monotone submodular maximization under general matroid constraints in the online setting.
Stochastic Submodular Maximization via Polynomial Estimators
In this paper, we study stochastic submodular maximization problems with general matroid constraints, that naturally arise in online learning, team formation, facility location, influence maximization, active learning and sensing objective functions.
Submodular Maximization via Taylor Series Approximation
We study submodular maximization problems with matroid constraints, in particular, problems where the objective can be expressed via compositions of analytic and multilinear functions.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
