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

166 citations · 1.4k across the 47 of their papers we have counts for

collaborators
Showing 2014Show all

5 papers · 1 filter

q-bio.MN2014

Faster graphical model identification of tandem mass spectra using peptide word lattices

Shengjie Wang, John T. Halloran, Jeff A. Bilmes +1

Liquid chromatography coupled with tandem mass spectrometry, also known as shotgun proteomics, is a widely-used high-throughput technology for identifying proteins in complex biolo…

cs.LG2014★ 9 cited

The Lovasz-Bregman Divergence and connections to rank aggregation, clustering, and web ranking

Rishabh Iyer, Jeff A. Bilmes

We extend the recently introduced theory of Lovasz-Bregman (LB) divergences (Iyer & Bilmes 2012) in several ways. We show that they represent a distortion between a "score" and an…

cs.LG2014

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

Rishabh Iyer, Jeff A. Bilmes

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

stat.ML2014★ 8 cited

Divide-and-Conquer Learning by Anchoring a Conical Hull

Tianyi Zhou, Jeff Bilmes, Carlos Guestrin

We reduce a broad class of machine learning problems, usually addressed by EM or sampling, to the problem of finding the extremal rays spanning the conical hull of a data point…

cs.DS2014★ 1 cited

Graph Cuts with Interacting Edge Costs - Examples, Approximations, and Algorithms

Stefanie Jegelka, Jeff Bilmes

We study an extension of the classical graph cut problem, wherein we replace the modular (sum of edge weights) cost function by a submodular set function defined over graph edges.…