Decomposable Submodular Function Minimization: Discrete and Continuous
arXiv:1703.01830
Abstract
This paper investigates connections between discrete and continuous approaches for decomposable submodular function minimization. We provide improved running time estimates for the state-of-the-art continuous algorithms for the problem using combinatorial arguments. We also provide a systematic experimental comparison of the two types of methods, based on a clear distinction between level-0 and level-1 algorithms.
Cited by in corpus (8)
- Signal Processing on Higher-Order Networks: Livin' on the Edge ... and Beyond
- Structured Optimal Transport
- Revisiting Decomposable Submodular Function Minimization with Incidence Relations
- Decomposable Submodular Function Minimization via Maximum Flow
- Fast Decomposable Submodular Function Minimization using Constrained Total Variation
- Quadratic Decomposable Submodular Function Minimization: Theory and Practice (Computation and Analysis of PageRank over Hypergraphs)
- Augmented Sparsifiers for Generalized Hypergraph Cuts with Applications to Decomposable Submodular Function Minimization
- Safe Element Screening for Submodular Function Minimization