Learning loopy graphical models with latent variables: efficient methods and guarantees
From MaRDI portal
Publication:355078
DOI10.1214/12-AOS1070zbMath1267.62070arXiv1203.3887OpenAlexW1994400630MaRDI QIDQ355078
Ragupathyraj Valluvan, Animashree Anandkumar
Publication date: 24 July 2013
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.3887
Estimation in multivariate analysis (62H12) Applications of graph theory (05C90) Monte Carlo methods (65C05) Distance in graphs (05C12)
Related Items
Learning loopy graphical models with latent variables: efficient methods and guarantees, Unnamed Item, Learning a tree-structured Ising model in order to make predictions, Discovering the topology of complex networks via adaptive estimators
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Latent variable graphical model selection via convex optimization
- Learning loopy graphical models with latent variables: efficient methods and guarantees
- High-dimensional structure estimation in Ising models: local separation criterion
- Girth and treewidth
- Ising models on locally tree-like graphs
- High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
- Gibbs measures and phase transitions
- Estimating the dimension of a model
- Recovering a tree from the leaf colourations it generates under a Markov model
- Rejoinder: Latent variable graphical model selection via convex optimization
- High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
- High-dimensional graphs and variable selection with the Lasso
- Optimal phylogenetic reconstruction
- On the girth of random Cayley graphs
- The Complexity of Distinguishing Markov Random Fields
- Information, Physics, and Computation
- Biological Sequence Analysis
- A few logs suffice to build (almost) all trees (I)
- 10.1162/jmlr.2003.3.4-5.993
- Inexact graph matching for structural pattern recognition
- Learning Latent Tree Graphical Models
- High-Dimensional Gaussian Graphical Model Selection: Walk Summability and Local Separation Criterion
- Combinatorial criteria for uniqueness of Gibbs measures
- Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms
- Learning nonsingular phylogenies and hidden Markov models
