The Complexity of Distinguishing Markov Random Fields
- Andrej BogdanovAffiliated withInstitute for Theoretical Computer Science, Tsinghua University
- , Elchanan MosselAffiliated withDept. of Statistics and Dept. of Computer Sciences, U.C. Berkeley
- , Salil VadhanAffiliated withSchool of Engineering and Applied Sciences, Harvard University
Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstructing a dependency graph of bounded degree from independent samples from the Markov random field. These results require observing samples of the distribution at all nodes of the graph. It was heuristically recognized that the problem of reconstructing the model where there are hidden variables (some of the variables are not observed) is much harder.
Here we prove that the problem of reconstructing bounded-degree models with hidden nodes is hard. Specifically, we show that unless NP = RP,
It is impossible to decide in randomized polynomial time if two models generate distributions whose statistical distance is at most 1/3 or at least 2/3.
Given two generating models whose statistical distance is promised to be at least 1/3, and oracle access to independent samples from one of the models, it is impossible to decide in randomized polynomial time which of the two samples is consistent with the model.
The second problem remains hard even if the samples are generated efficiently, albeit under a stronger assumption.
- The Complexity of Distinguishing Markov Random Fields
- Book Title
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Book Subtitle
- 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings
- pp 331-342
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Industry Sectors
- eBook Packages
- Author Affiliations
- 1. Institute for Theoretical Computer Science, Tsinghua University,
- 2. Dept. of Statistics and Dept. of Computer Sciences, U.C. Berkeley,
- 3. School of Engineering and Applied Sciences, Harvard University,
To view the rest of this content please follow the download PDF link above.