Efficient minimization of higher order submodular functions using monotonic Boolean functions
<p>Submodular function minimization is a key problem in a wide variety of applications in machine learning, economics, game theory, computer vision, and many others. The general solver has a complexity of O(n3 log2 n:E + n4logO(1)n) where E is the time required to evaluate the function and n i...
| Main Authors: | , , , |
|---|---|
| Format: | Journal article |
| Published: |
Elsevier
2017
|