Accelerated Dual Decomposition for MAP Inference
Approximate MAP inference in graphical models is an important and challenging problem for many domains including computer vision, computational biology and natural language understanding. Current state-of-the-art approaches employ convex relaxations of these problems as surrogate objectives, but only provide weak running time guarantees. In this paper, we develop an approximate inference algorithm that is both efficient and has strong theoretical guarantees. Specifically, our algorithm is...[Show more]
|Collections||ANU Research Publications|
|Source:||Proceedings of International Conference on Machine Learning (ICML 2010)|
|01_Jojic_Accelerated_Dual_Decomposition_2010.pdf||655.88 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.