MLDec 12, 2016

Monte Carlo Structured SVI for Two-Level Non-Conjugate Models

arXiv:1612.03957v37 citations
Originality Incremental advance
AI Analysis

This work addresses the problem of large-scale learning in non-conjugate Bayesian models for researchers and practitioners in machine learning, representing an incremental extension of SVI with a novel hybrid gradient method for improved stability.

The paper tackles the challenge of applying stochastic variational inference (SVI) to non-conjugate Bayesian latent variable models with two levels of hidden variables, resulting in the development of Monte Carlo Structured SVI (MC-SSVI), which extends SVI's applicability and demonstrates effectiveness in applications like mixed effects models and probabilistic matrix factorization.

The stochastic variational inference (SVI) paradigm, which combines variational inference, natural gradients, and stochastic updates, was recently proposed for large-scale data analysis in conjugate Bayesian models and demonstrated to be effective in several problems. This paper studies a family of Bayesian latent variable models with two levels of hidden variables but without any conjugacy requirements, making several contributions in this context. The first is observing that SVI, with an improved structured variational approximation, is applicable under more general conditions than previously thought with the only requirement being that the approximating variational distribution be in the same family as the prior. The resulting approach, Monte Carlo Structured SVI (MC-SSVI), significantly extends the scope of SVI, enabling large-scale learning in non-conjugate models. For models with latent Gaussian variables we propose a hybrid algorithm, using both standard and natural gradients, which is shown to improve stability and convergence. Applications in mixed effects models, sparse Gaussian processes, probabilistic matrix factorization and correlated topic models demonstrate the generality of the approach and the advantages of the proposed algorithms.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes