Consistent and efficient reconstruction of latent tree models
Name
Willsky_Consistent and efficient.pdf
Size
386.39 KB
Format
Adobe PDF
Checksum (MD5)
12c411dc444c5b2006631f410f9b3a54
Author(s)
Choi, Myung Jin
Tan, Vincent Yan Fu
Anandkumar, Animashree
Willsky, Alan S.
Date Issued
September 2010
Journal
Proceedings of the 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2010
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Choi, Myung Jin et al. “Consistent and Efficient Reconstruction of Latent Tree Models.” 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2010. 719–725. ©2010 IEEE
Version
Final published version
Abstract
We study the problem of learning a latent tree graphical model where samples are available only from a subset of variables. We propose two consistent and computationally efficient algorithms for learning minimal latent trees, that is, trees without any redundant hidden nodes. Our first algorithm, recursive grouping, builds the latent tree recursively by identifying sibling groups. Our second and main algorithm, CLGrouping, starts with a pre-processing procedure in which a tree over the observed variables is constructed. This global step guides subsequent recursive grouping (or other latent-tree learning procedures) on much smaller subsets of variables. This results in more accurate and efficient learning of latent trees. We compare the proposed algorithms to other methods by performing extensive numerical experiments on various latent tree graphical models such as hidden Markov models and star graphs.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ALLERTON.2010.5706978
