3 citations · 3 across the 2 of their papers we have counts for
2 papers
stat.ML2020
Graph cuts always find a global optimum for Potts models (with a catch)
Hunter Lang, David Sontag, Aravindan Vijayaraghavan
We prove that the -expansion algorithm for MAP inference always returns a globally optimal assignment for Markov Random Fields with Potts pairwise potentials, with a catch: the…
stat.ML2017★ 3 cited
Optimality of Approximate Inference Algorithms on Stable Instances
Hunter Lang, David Sontag, Aravindan Vijayaraghavan
Approximate algorithms for structured prediction problems---such as LP relaxations and the popular alpha-expansion algorithm (Boykov et al. 2001)---typically far exceed their theor…