Efficient Minimization of Decomposable Submodular Functions
Published on Mar 25, 20113184 Views
Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of convex functions, and c