Learning and evaluation of latent dependency forest models
Lists
Only you see this
Abstract
Latent dependency forest models (LDFMs) are a new type of probabilistic models with dynamic dependency structures over random variables. They distinguish themselves from other probabilistic models by the fact that there is no need for structure search when learning the models. However, parameter learning of LDFMs is still quite challenging since the partition function cannot be tractably calculated. In this paper, we investigate and empirically compare several algorithms of learning parameters of LDFMs which either approximate or ignore the partition function in the learning objective. Furthermore, we propose an approximate algorithm to estimate the partition function of LDFM. Experimental results show that (1) our learning algorithms can achieve better results than the previous learning algorithm of LDFMs, and (2) our partition function estimation algorithm is accurate.
BibTeX
@article{jiang2019learning,
author = {Yong Jiang and Yang Zhou and Kewei Tu},
title = {{Learning and evaluation of latent dependency forest models}},
journal = {Neural Computing and Applications},
year = {2019},
url = {https://openreview.net/forum?id=YsjkGpYGTMY},
}Loading related content...