Deep Latent Dirichlet Allocation with Topic-Layer-Adaptive Stochastic Gradient Riemannian MCMC
Abstract
It is challenging to develop stochastic gradient based scalable inference for deep discrete latent variable models (LVMs), due to the difficulties in not only computing the gradients, but also adapting the step sizes to different latent factors and hidden layers. For the Poisson gamma belief network (PGBN), a recently proposed deep discrete LVM, we derive an alternative representation that is referred to as deep latent Dirichlet allocation (DLDA). Exploiting data augmentation and marginalization techniques, we derive a block-diagonal Fisher information matrix and its inverse for the simplex-constrained global model parameters of DLDA. Exploiting that Fisher information matrix with stochastic gradient MCMC, we present topic-layer-adaptive stochastic gradient Riemannian (TLASGR) MCMC that jointly learns simplex-constrained global parameters across all layers and topics, with topic and layer specific learning rates. State-of-the-art results are demonstrated on big data sets.
Cite
Text
Cong et al. "Deep Latent Dirichlet Allocation with Topic-Layer-Adaptive Stochastic Gradient Riemannian MCMC." International Conference on Machine Learning, 2017.Markdown
[Cong et al. "Deep Latent Dirichlet Allocation with Topic-Layer-Adaptive Stochastic Gradient Riemannian MCMC." International Conference on Machine Learning, 2017.](https://mlanthology.org/icml/2017/cong2017icml-deep/)BibTeX
@inproceedings{cong2017icml-deep,
title = {{Deep Latent Dirichlet Allocation with Topic-Layer-Adaptive Stochastic Gradient Riemannian MCMC}},
author = {Cong, Yulai and Chen, Bo and Liu, Hongwei and Zhou, Mingyuan},
booktitle = {International Conference on Machine Learning},
year = {2017},
pages = {864-873},
volume = {70},
url = {https://mlanthology.org/icml/2017/cong2017icml-deep/}
}