Kernel Embeddings of Latent Tree Graphical Models

Abstract

Latent tree graphical models are natural tools for expressing long range and hierarchical dependencies among many variables which are common in computer vision, bioinformatics and natural language processing problems. However, existing models are largely restricted to discrete and Gaussian variables due to computational constraints; furthermore, algorithms for estimating the latent tree structure and learning the model parameters are largely restricted to heuristic local search. We present a method based on kernel embeddings of distributions for latent tree graphical models with continuous and non-Gaussian variables. Our method can recover the latent tree structures with provable guarantees and perform local-minimum free parameter learning and efficient inference. Experiments on simulated and real data show the advantage of our proposed approach.

Cite this paper

@article{song2018kernel,
  title = {{Kernel Embeddings of Latent Tree Graphical Models}},
  author = {Song, Le and Xing, Eric P. and Parikh, Ankur P.},
  journal = {Figshare},
  volume = {24},
  pages = {2708--2716},
  year = {2018},
  doi = {10.1184/r1/6475826}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers