Spectral methods for learning discrete latent tree models

DOI10.4310/SII.2017.V10.N4.A11zbMATH Open1388.62156OpenAlexW2617432769MaRDI QIDQ1748693FDOQ1748693

Authors: Xiao Fei Wang, Jianhua Guo, Lizhu Hao, Nevin L. Zhang 

Publication date: 14 May 2018

Published in: Statistics and Its Interface (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4310/sii.2017.v10.n4.a11

Recommendations

• Learning latent tree graphical models
• Spectral learning of latent-variable PCFGs: algorithms and sample complexity
• Spectral neighbor joining for reconstruction of latent tree models
• Tensor decompositions for learning latent variable models
• A spectral algorithm for learning hidden Markov models

zbMATH Keywords

parameter estimationlatent variablesstructural learningspectral distance

Mathematics Subject Classification ID

Characterization and structure theory for multivariate probability distributions; copulas (62H05) Estimation in multivariate analysis (62H12)

Cited In (5)

• Learning latent tree graphical models
• Spectral neighbor joining for reconstruction of latent tree models
• Spectral learning of latent-variable PCFGs: algorithms and sample complexity
• Learning Decision Trees Using the Fourier Spectrum
• Paralinear distance and its algorithm for hierarchical clustering of high-dimensional discrete variables

This page was built for publication: Spectral methods for learning discrete latent tree models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1748693)