Efficiently Searching for Frustrated Cycles in MAP Inference

Dual decomposition provides a tractable framework for designing algorithms for finding the most probable (MAP) configuration in graphical models. However, for many real-world inference problems, the typical decomposition has a large integrality gap, due to frustrated cycles. One way to tighten the r...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2012-10
Hauptverfasser:	Sontag, David, Choe, Do Kook, Li, Yitao
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Consistency Decomposition Inference Search algorithms
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!