Gaussian variational approximation with sparse precision matrices

From MaRDI portal
Publication:1702005

DOI10.1007/S11222-017-9729-7zbMATH Open1384.62105arXiv1605.05622OpenAlexW3103982962MaRDI QIDQ1702005FDOQ1702005

David J. Nott, Linda S. L. Tan

Publication date: 27 February 2018

Published in: Statistics and Computing (Search for Journal in Brave)

Abstract: We consider the problem of learning a Gaussian variational approximation to the posterior distribution for a high-dimensional parameter, where we impose sparsity in the precision matrix to reflect appropriate conditional independence structure in the model. Incorporating sparsity in the precision matrix allows the Gaussian variational distribution to be both flexible and parsimonious, and the sparsity is achieved through parameterization in terms of the Cholesky factor. Efficient stochastic gradient methods which make appropriate use of gradient information for the target distribution are developed for the optimization. We consider alternative estimators of the stochastic gradients which have lower variation and are more stable. Our approach is illustrated using generalized linear mixed models and state space models for time series.


Full work available at URL: https://arxiv.org/abs/1605.05622




Recommendations




Cites Work


Cited In (24)

Uses Software





This page was built for publication: Gaussian variational approximation with sparse precision matrices

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