Local rules for global MAP: When do they work?
We consider the question of computing Maximum A Posteriori (MAP) assignment in an arbitrary pair-wise Markov Random Field (MRF). We present a randomized iterative algorithm based on simple local updates. The algorithm, starting with an arbitrary initial assignment, updates it in each iteration by fi...
Main Authors: | Jung, Kyomin, Kohli, Pushmeet, Shah, Devavrat |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | English |
Published: |
MIT Press
2021
|
Online Access: | https://hdl.handle.net/1721.1/137163.2 |
Similar Items
-
Local rules for global MAP: When do they work?
by: Shah, Devavrat
Published: (2021) -
Partition-Merge: Distributed Inference and Modularity Optimization
by: Blondel, Vincent, et al.
Published: (2022) -
Distributed Averaging Via Lifted Markov Chains
by: Jung, Kyomin, et al.
Published: (2012) -
Computing the Capacity Region of a Wireless Network
by: Gummadi, Ramakrishna, et al.
Published: (2011) -
When do rule changes count-as legal rule changes?
by: King, T, et al.
Published: (2016)