Scaling laws for learning high-dimensional Markov forest distributions
The problem of learning forest-structured discrete graphical models from i.i.d. samples is considered. An algorithm based on pruning of the Chow-Liu tree through adaptive thresholding is proposed. It is shown that this algorithm is structurally consistent and the error probability of structure learn...
Main Authors: | Willsky, Alan S. (Contributor), Tan, Vincent Yan Fu (Contributor), Anandkumar, Animashree (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Laboratory for Information and Decision Systems (Contributor) |
Format: | Article |
Language: | English |
Published: |
Institute of Electrical and Electronics Engineers (IEEE),
2012-10-04T13:43:41Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Learning high-dimensional Markov forest distributions: Analysis of error rates
by: Tan, Vincent Yan Fu, et al.
Published: (2011) -
Error exponents for composite hypothesis testing of Markov forest distributions
by: Tan, Vincent Yan Fu, et al.
Published: (2012) -
A Large-Deviation Analysis of the Maximum-Likelihood Learning of Markov Tree Structures
by: Tan, Vincent Yan Fu, et al.
Published: (2012) -
High-Dimensional Gaussian Graphical Model Selection: Walk Summability and Local Separation Criterion
by: Willsky, Alan S., et al.
Published: (2013) -
High-Dimensional Graphical Model Selection: Tractable Graph Families and Necessary Conditions
by: Anandkumar, Animashree, et al.
Published: (2013)