Information theoretic properties of Markov Random Fields, and their algorithmic applications
Markov random fields are a popular model for high-dimensional probability distributions. Over the years, many mathematical, statistical and algorithmic problems on them have been studied. Until recently, the only known algorithms for provably learning them relied on exhaustive search, correlation de...
Main Authors: | Hamilton, Linus Ulysses (Contributor), Koehler, Frederic (Contributor), Moitra, Ankur (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Department of Mathematics (Contributor) |
Format: | Article |
Language: | English |
Published: |
2018-06-11T18:02:46Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Combinatorial Markov Random Fields and their applications to information organization
by: Bekkerman, Ron
Published: (2008) -
The Paulsen Problem Made Simple
by: Hamilton, Linus, et al.
Published: (2021) -
Sequential value information for Markov random field
by: Sneltvedt, Tommy
Published: (2011) -
Provable algorithms for inference in topic models
by: Arora, Sanjeev, et al.
Published: (2018) -
The Application of Markov Random Field on Image Processing
by: 趙中理
Published: (1997)