20 citations · 33 across the 3 of their papers we have counts for
3 papers
cs.DM2018★ 13 cited
Greed is Still Good: Maximizing Monotone Submodular+Supermodular Functions
Wenruo Bai, Jeffrey A. Bilmes
We analyze the performance of the greedy algorithm, and also a discrete semi-gradient based algorithm, for maximizing the sum of a suBmodular and suPermodular (BP) function (both o…
cs.LG2017★ 20 cited
Deep Submodular Functions
Jeffrey Bilmes, Wenruo Bai
We start with an overview of a class of submodular functions called SCMMs (sums of concave composed with non-negative modular functions plus a final arbitrary modular). We then def…
cs.DS2015
Mixed Robust/Average Submodular Partitioning: Fast Algorithms, Guarantees, and Applications to Parallel Machine Learning and Multi-Label Image Segmentation
Kai Wei, Rishabh Iyer, Shengjie Wang +2
We study two mixed robust/average-case submodular partitioning problems that we collectively call Submodular Partitioning. These problems generalize both purely robust instances of…