Deeparnab Chakrabarty: Provable Submodular Function Minimization via Fujishige Wolfe Algorithm

Subscribers:
344,000
Published on ● Video Link: https://www.youtube.com/watch?v=VI_uatv3EUs



Duration: 3:02
666 views
8


The Fujishige-Wolfe heuristic is empirically one of the fastest algorithms for Submodular Function Minimization and is based upon Wolfe's algorithm to find the nearest point on a polytope to the origin. There was no theoretical guarantees known for the same. In this work we give a convergence analysis for Wolfe's algorithm which implies a pseudo-polynomial running time for the Fujishige Wolfe algorithm.







Tags:
microsoft research