Learning latent tree graphical models
From MaRDI portal
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. Unlike many existing methods, the observed nodes (or variables) are not constrained to be leaf nodes. Our first algorithm, recursive grouping, builds the latent tree recursively by identifying sibling groups using so-called information distances. One of the main contributions of this work is our second algorithm, which we refer to as CLGrouping. CLGrouping starts with a pre-processing procedure in which a tree over the observed variables is constructed. This global step groups the observed nodes that are likely to be close to each other in the true latent tree, thereby guiding subsequent recursive grouping (or equivalent procedures) on much smaller subsets of variables. This results in more accurate and efficient learning of latent trees. We also present regularized versions of our algorithms that learn latent tree approximations of arbitrary distributions. 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. In addition, we demonstrate the applicability of our methods on real-world datasets by modeling the dependency structure of monthly stock returns in the S&P index and of the words in the 20 newsgroups dataset.
Recommendations
- Spectral methods for learning discrete latent tree models
- Learning minimal latent directed information polytrees
- Graphical model selection for Gaussian conditional random fields in the presence of latent variables
- Latent variable graphical model selection via convex optimization
- Learning loopy graphical models with latent variables: efficient methods and guarantees
Cited in
(32)- Latent tree models for hierarchical topic detection
- UC-LTM: unidimensional clustering using latent tree models for discrete data
- Spectral methods for learning discrete latent tree models
- Estimating heterogeneous gene regulatory networks from zero-inflated single-cell expression data
- Latent association graph inference for binary transaction data
- Greedy learning of latent tree models for multidimensional clustering
- Sum-product graphical models
- Maximum likelihood estimation in Gaussian models under total positivity
- Variational circular treemaps for hierarchical data
- scientific article; zbMATH DE number 6484043 (Why is no real title available?)
- Learning loopy graphical models with latent variables: efficient methods and guarantees
- scientific article; zbMATH DE number 5547949 (Why is no real title available?)
- A survey on latent tree models and applications
- Spectral neighbor joining for reconstruction of latent tree models
- Incomplete graphical model inference via latent tree aggregation
- Learning mixed latent tree models
- Robust Estimation of Latent Tree Graphical Models: Inferring Hidden States With Inexact Parameters
- Learning minimal latent directed information polytrees
- Learning Tree Patterns from Example Graphs
- Sparse nonparametric graphical models
- Learning Gaussian graphical models with latent confounders
- Identifiability of Hierarchical Latent Attribute Models
- Identifiability in robust estimation of tree structured models
- Paralinear distance and its algorithm for hierarchical clustering of high-dimensional discrete variables
- Phase transition in the sample complexity of likelihood-based phylogeny inference
- CoRMF: criticality-ordered recurrent mean field Ising solver
- High-dimensional structure estimation in Ising models: local separation criterion
- Blessing of dependence: identifiability and geometry of discrete models with multiple binary latent variables
- Learning semi-parametric tree models from mixed data
- Learning latent tree models with small query complexity
- Learning extended tree augmented naive structures
- The tree structure of graphs for various graphical models
This page was built for publication: Learning latent tree graphical models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5396658)
