166 citations · 1.4k across the 47 of their papers we have counts for
4 papers · 2 filters
apricot: Submodular selection for data summarization in Python
Jacob Schreiber, Jeffrey Bilmes, William Stafford Noble
We present apricot, an open source Python package for selecting representative subsets from large data sets using submodular optimization. The package implements an efficient greed…
Coresets for Data-efficient Training of Machine Learning Models
Baharan Mirzasoleiman, Jeff Bilmes, Jure Leskovec
Incremental gradient (IG) methods, such as stochastic gradient descent and its variants are commonly used for large scale optimization in machine learning. Despite the sustained ef…
A Memoization Framework for Scaling Submodular Optimization to Large Scale Problems
Rishabh Iyer, Jeff Bilmes
We are motivated by large scale submodular optimization problems, where standard algorithms that treat the submodular functions in the \emph{value oracle model} do not scale. In th…
Near Optimal Algorithms for Hard Submodular Programs with Discounted Cooperative Costs
Rishabh Iyer, Jeff Bilmes
In this paper, we investigate a class of submodular problems which in general are very hard. These include minimizing a submodular cost function under combinatorial constraints, wh…