activity
20112026
most citedSubmodular Optimization with Submodular Cover and Submodular Knapsack Constraints

166 citations · 515 across the 60 of their papers we have counts for

collaborators
Showing cs.DSShow all

5 papers · 1 filter

cs.DS2015★ 9 cited

Submodular Hamming Metrics

Jennifer Gillenwater, Rishabh Iyer, Bethany Lusch +2

We show that there is a largely unexplored class of functions (positive polymatroids) that can define proper discrete metrics over pairs of binary vectors and that are fairly tract…

cs.DS2013★ 45 cited

Curvature and Optimal Algorithms for Learning and Minimizing Submodular Functions

Rishabh Iyer, Stefanie Jegelka, Jeff Bilmes

We investigate three related and important problems connected to machine learning: approximating a submodular function everywhere, learning a submodular function (in a PAC-like set…

cs.DS2013★ 166 cited

Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints

Rishabh Iyer, Jeff Bilmes

We investigate two new optimization problems -- minimizing a submodular function subject to a submodular lower bound constraint (submodular cover) and maximizing a submodular funct…

cs.DS2013★ 52 cited

Fast Semidifferential-based Submodular Function Optimization

Rishabh Iyer, Stefanie Jegelka, Jeff Bilmes

We present a practical and powerful new framework for both unconstrained and constrained submodular function optimization based on discrete semidifferentials (sub- and super-differ…

cs.DS2012★ 73 cited

Algorithms for Approximate Minimization of the Difference Between Submodular Functions, with Applications

Rishabh Iyer, Jeff Bilmes

We extend the work of Narasimhan and Bilmes [30] for minimizing set functions representable as a difference between submodular functions. Similar to [30], our new algorithms are gu…