Create and explore imaginative 3D worlds with our new product Dreamfield (opens in a new tab)
Papers
Topics
Authors
Recent
Search
2000 character limit reached

Augmented Sparsifiers for Generalized Hypergraph Cuts with Applications to Decomposable Submodular Function Minimization

Published 16 Jul 2020 in cs.DS and cs.DM | (2007.08075v2)

Abstract: In recent years, hypergraph generalizations of many graph cut problems have been introduced and analyzed as a way to better explore and understand complex systems and datasets characterized by multiway relationships. Recent work has made use of a generalized hypergraph cut function which for a hypergraph H=(V,E)\mathcal{H} = (V,E) can be defined by associating each hyperedge e∈Ee \in E with a splitting function we{\bf w}_e, which assigns a penalty to each way of separating the nodes of ee. When each we{\bf w}_e is a submodular cardinality-based splitting function, meaning that we(S)=g(∣S∣){\bf w}_e(S) = g(|S|) for some concave function gg, previous work has shown that a generalized hypergraph cut problem can be reduced to a directed graph cut problem on an augmented node set. However, existing reduction procedures often result in a dense graph, even when the hypergraph is sparse, which leads to slow runtimes for algorithms that run on the reduced graph. We introduce a new framework of sparsifying hypergraph-to-graph reductions, where a hypergraph cut defined by submodular cardinality-based splitting functions is (1+ε)(1+\varepsilon)-approximated by a cut on a directed graph. Our techniques are based on approximating concave functions using piecewise linear curves. For ε>0\varepsilon > 0 we need at most O(ε−1∣e∣log⁡∣e∣)O(\varepsilon^{-1}|e| \log |e|) edges to reduce any hyperedge ee, which leads to faster runtimes for approximating generalized hypergraph ss-tt cut problems. For the machine learning heuristic of a clique splitting function, our approach requires only O(∣e∣ε−1/2log⁡log⁡1ε)O(|e| \varepsilon^{-1/2} \log \log \frac{1}{\varepsilon}) edges. This sparsification leads to faster approximate min ss-tt graph cut algorithms for certain classes of co-occurrence graphs. Finally, we apply our sparsification techniques to develop approximation algorithms for minimizing sums of cardinality-based submodular functions.

Citations (10)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.