Polynomial-Time Constrained Message Passing for Exact MAP Inference on Discrete Models with Global Dependencies

Polynomial-Time Constrained Message Passing for Exact MAP Inference on Discrete Models with Global Dependencies

Considering the worst-case scenario, the junction-tree algorithm remains the most general solution for exact MAP inference with polynomial run-time guarantees. Unfortunately, its main tractability assumption requires the treewidth of a corresponding MRF to be bounded, strongly limiting the range of...

Full description

Bibliographic Details
Main Authors: Alexander Bauer, Shinichi Nakajima, Klaus-Robert Müller
Format: Article
Language:English
Published: MDPI AG 2023-06-01
Series:Mathematics
Subjects:
algorithm
optimization
dynamic programming
Online Access:https://www.mdpi.com/2227-7390/11/12/2628

Internet

https://www.mdpi.com/2227-7390/11/12/2628

Similar Items