Optimality of Approximate Inference Algorithms on Stable Instances

6 Nov 2017 • 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 theoretical performance guarantees on real-world instances. These algorithms often find solutions that are very close to optimal... (read more)

PDF Abstract

Results from the Paper

Edit

Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

METHOD	TYPE
🤖 No Methods Found	Help the community by adding them if they're not listed; e.g. Deep Residual Learning for Image Recognition uses ResNet

Optimality of Approximate Inference Algorithms on Stable Instances

Code

Add Remove Mark official

Tasks

Add Remove

Results from the Paper

Edit

Methods used in the Paper

Add Remove

Optimality of Approximate Inference Algorithms on Stable Instances

Code Edit Add Remove Mark official

Tasks Edit Add Remove

Results from the Paper Edit

Methods used in the Paper Edit Add Remove

Code

Add Remove Mark official

Tasks

Add Remove

Results from the Paper

Edit

Methods used in the Paper

Add Remove