Optimality of Approximate Inference Algorithms on Stable InstancesDownload PDFOpen Website

2018 (modified: 02 Mar 2022)AISTATS 2018Readers: Everyone
Abstract: Approximate algorithms for structured prediction problems—such as LP relaxations and the popular α-expansion algorithm (Boykov et al. 2001)—typically far exceed their theoretical performance guaran...
0 Replies

Loading