Add to ORKGCombinatorial problems with submodular cost functions have recently drawn interest. In a standard combinatorial problem, the sum-of-weights cost is replaced by a submodular set function. The result is a powerful model that is though very hard. In this talk, I will introduce cooperative cuts, minimum cuts with submodular edge weights. I will outline methods to approximately solve this problem, and show an application in computer vision. If time permits, the talk will also sketch regret-minimizing online algorithms for submodular-cost combinatorial problems. This is joint work with Jeff Bilmes (University of Washington)
Most results for online decision problems with structured concepts, such as trees or cuts, assume li...
We propose a novel framework for graph-based cooperative regularization that uses submodular costs o...
Building on recent results for submodular minimization with combinatorial constraints, and on online...
Combinatorial problems with submodular cost functions have recently drawn interest. In a standard co...
We introduce cooperative cut, a minimum cut problem whose cost is a submodular function on sets of e...
We introduce a problem we call Cooperative cut, where the goal is to find a minimum-cost graph cut b...
Abstract. We introduce Cooperative cut, a minimum-cost graph cut with a submodular cost function def...
We introduce a problem we call Cooperative cut, where the goal is to find a minimum-cost graph cut b...
Submodular functions are an important class of functions in combinatorial optimiza-tion which satisf...
This paper presents the first combinatorial polynomial-time algorithm for minimizing submodular func...
Generalizing the cost in the standard min-cut problem to a submodular cost function immediately make...
Most results for online decision problems with structured concepts, such as trees or cuts, as-sume l...
Maximization or minimization problems in which, for each input there is a set of feasible solutions ...
We propose a novel framework for graph-based cooperative regularization that uses submodular costs o...
We propose a novel framework for graph-based cooperative regularization that uses submodular costs o...
Most results for online decision problems with structured concepts, such as trees or cuts, assume li...
We propose a novel framework for graph-based cooperative regularization that uses submodular costs o...
Building on recent results for submodular minimization with combinatorial constraints, and on online...
Combinatorial problems with submodular cost functions have recently drawn interest. In a standard co...
We introduce cooperative cut, a minimum cut problem whose cost is a submodular function on sets of e...
We introduce a problem we call Cooperative cut, where the goal is to find a minimum-cost graph cut b...
Abstract. We introduce Cooperative cut, a minimum-cost graph cut with a submodular cost function def...
We introduce a problem we call Cooperative cut, where the goal is to find a minimum-cost graph cut b...
Submodular functions are an important class of functions in combinatorial optimiza-tion which satisf...
This paper presents the first combinatorial polynomial-time algorithm for minimizing submodular func...
Generalizing the cost in the standard min-cut problem to a submodular cost function immediately make...
Most results for online decision problems with structured concepts, such as trees or cuts, as-sume l...
Maximization or minimization problems in which, for each input there is a set of feasible solutions ...
We propose a novel framework for graph-based cooperative regularization that uses submodular costs o...
We propose a novel framework for graph-based cooperative regularization that uses submodular costs o...
Most results for online decision problems with structured concepts, such as trees or cuts, assume li...
We propose a novel framework for graph-based cooperative regularization that uses submodular costs o...
Building on recent results for submodular minimization with combinatorial constraints, and on online...