25 citations · 31 across the 3 of their papers we have counts for
3 papers
cs.LG2019★ 25 cited
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…
cs.LG2019★ 3 cited
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…
cs.LG2019★ 3 cited
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…