2021
Adaptive Sampling for Fast Constrained Maximization of Submodular Functions
AISTATS 2021poster
Several large-scale machine learning tasks, such as data summarization, can be approached by maximizing functions that satisfy submodularity. These optimization problems often involve complex side constraints, imposed by the underlying application. In this paper, we develop an algorithm with poly-lo…