MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming
From MaRDI portal
Publication:3547762
DOI10.1109/TIT.2005.856938zbMath1318.94025arXivcs/0508070OpenAlexW2108619558MaRDI QIDQ3547762
Martin J. Wainwright, Alan S. Willsky, Tommi S. Jaakkola
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0508070
Markov processes: estimation; hidden Markov models (62M05) Linear programming (90C05) Detection theory in information and communication theory (94A13)
Related Items
Cycle-based cluster variational method for direct and inverse inference ⋮ Inference methods for CRFs with co-occurrence statistics ⋮ Decoding turbo-like codes via linear programming ⋮ Improved generalized belief propagation for vision processing ⋮ Fast structured prediction using large margin sigmoid belief networks ⋮ On learning conditional random fields for stereo ⋮ Global minimization for continuous multiphase partitioning problems using a dual approach ⋮ Discriminative models for multi-class object layout ⋮ Leveraging cluster backbones for improving MAP inference in statistical relational models ⋮ Unsupervised multi-class segmentation of SAR images using fuzzy triplet Markov fields model ⋮ Message-passing algorithms for inference and optimization ⋮ A spatially continuous max-flow and min-cut framework for binary labeling problems ⋮ Bilevel Optimization with Nonsmooth Lower Level Problems ⋮ Conditional random fields for pattern recognition applied to structured data ⋮ Data association based on optimization in graphical models with application to sensor networks ⋮ A survey and comparison of discrete and continuous multi-label optimization approaches for the Potts model ⋮ Combinatorial optimization of the discretized multiphase Mumford-Shah functional ⋮ Optical flow estimation with occlusion detection ⋮ Global optimization for first order Markov random fields with submodular priors ⋮ Soft arc consistency revisited ⋮ Scale selection for anisotropic diffusion filter by Markov random field model ⋮ Global optimization of wavelet-domain hidden Markov tree for image segmentation ⋮ Understanding the scalability of Bayesian network inference using clique tree growth curves ⋮ Multiscale stochastic modeling for tractable inference and data assimilation ⋮ Learning adaptive regularization for image labeling using geometric assignment ⋮ Image Labeling Based on Graphical Models Using Wasserstein Messages and Geometric Assignment ⋮ Efficient semidefinite branch-and-cut for MAP-MRF inference ⋮ MAP inference via \(\ell_2\)-sphere linear program reformulation ⋮ Diffusion methods for classification with pairwise relationships ⋮ Iterated conditional modes for inverse dithering ⋮ The Power of Linear Programming for General-Valued CSPs ⋮ Unnamed Item ⋮ A Doubly Graduated Method for Inference in Markov Random Field ⋮ Lifted graphical models: a survey ⋮ Distributed primal–dual interior-point methods for solving tree-structured coupled convex problems using message-passing ⋮ Multilabel classification through random graph ensembles ⋮ Energy distribution view for monotonic dual decomposition
This page was built for publication: MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming