Identifiability in robust estimation of tree structured models
From MaRDI portal
Abstract: Consider the problem of learning undirected graphical models on trees from corrupted data. Recently Katiyar et al. showed that it is possible to recover trees from noisy binary data up to a small equivalence class of possible trees. Their other paper on the Gaussian case follows a similar pattern. By framing this as a special phylogenetic recovery problem we largely generalize these two settings. Using the framework of linear latent tree models we discuss tree identifiability for binary data under a continuous corruption model. For the Ising and the Gaussian tree model we also provide a characterisation of when the Chow-Liu algorithm consistently learns the underlying tree from the noisy data.
Cites work
- scientific article; zbMATH DE number 6484043 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 7370576 (Why is no real title available?)
- A note on positive definite matrices
- A tree-structured Markov random field model for bayesian image segmentation
- Approximating discrete probability distributions with dependence trees
- Full reconstruction of Markov models on evolutionary trees: identifiability and consistency.
- Hierarchical latent class models for cluster analysis
- Latent tree models
- Learning a tree-structured Ising model in order to make predictions
- Learning latent tree graphical models
- Robust Estimation of Latent Tree Graphical Models: Inferring Hidden States With Inexact Parameters
This page was built for publication: Identifiability in robust estimation of tree structured models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6090235)
