AD^3: alternating directions dual decomposition for MAP inference in graphical models
From MaRDI portal
Publication:5502118
Recommendations
Cited in
(10)- Efficient semidefinite branch-and-cut for MAP-MRF inference
- MAP inference via _2-sphere linear program reformulation
- A biclustering approach based on factor graphs and the max-sum algorithm
- Energy distribution view for monotonic dual decomposition
- Variational algorithms for marginal MAP
- Inference on highly-connected discrete graphical models with applications to visual object recognition
- A tutorial on dual decomposition and Lagrangian relaxation for inference in natural language processing
- Hinge-loss Markov random fields and probabilistic soft logic
- Discrete graphical models -- an optimization perspective
- MAP inference algorithms without approximation for collective graphical models on path graphs via discrete difference of convex algorithm
This page was built for publication: \(\mathrm{AD}^3\): alternating directions dual decomposition for MAP inference in graphical models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5502118)