activity
20082025
most citedRepresentation Learning on Graphs with Jumping Knowledge Networks

970 citations · 3k across the 88 of their papers we have counts for

collaborators
Showing cs.DSShow all

5 papers · 1 filter

cs.DS2017★ 1 cited

Streaming Non-monotone Submodular Maximization: Personalized Video Summarization on the Fly

Baharan Mirzasoleiman, Stefanie Jegelka, Andreas Krause

The need for real time analysis of rapidly producing data streams (e.g., video and image streams) motivated the design of streaming algorithms that can efficiently extract and summ…

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.…

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★ 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.DS2008★ 4 cited

Approximation Algorithms for Bregman Co-clustering and Tensor Clustering

Stefanie Jegelka, Suvrit Sra, Arindam Banerjee

In the past few years powerful generalizations to the Euclidean k-means problem have been made, such as Bregman clustering [7], co-clustering (i.e., simultaneous clustering of rows…