On fast approximate submodular minimization

Abstract

We are motivated by an application to extract a representative subset of machine learning training data and by the poor empirical performance we observe of the popular minimum norm algorithm. In fact, for our application, minimum norm can have a running time of about O(n) (O(n) oracle calls). We therefore propose a fast approximate method to minimize… (More)

Topics

3 Figures and Tables

Statistics

0204060201520162017
Citations per Year

Citation Velocity: 23

Averaging 23 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.