Patterns of scalable Bayesian inference

From MaRDI portal
Publication:2988018

DOI10.1561/2200000052zbMATH Open1364.68318arXiv1602.05221OpenAlexW4205433696MaRDI QIDQ2988018FDOQ2988018


Authors: Elaine Angelino, Matthew James Johnson, Ryan P. Adams Edit this on Wikidata


Publication date: 18 May 2017

Published in: Foundations and Trends® in Machine Learning (Search for Journal in Brave)

Abstract: Datasets are growing not just in size but in complexity, creating a demand for rich models and quantification of uncertainty. Bayesian methods are an excellent fit for this demand, but scaling Bayesian inference is a challenge. In response to this challenge, there has been considerable recent work based on varying assumptions about model structure, underlying computational resources, and the importance of asymptotic correctness. As a result, there is a zoo of ideas with few clear overarching principles. In this paper, we seek to identify unifying principles, patterns, and intuitions for scaling Bayesian inference. We review existing work on utilizing modern computing resources with both MCMC and variational approximation techniques. From this taxonomy of ideas, we characterize the general principles that have proven successful for designing scalable inference procedures and comment on the path forward.


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




Recommendations





Cited In (11)





This page was built for publication: Patterns of scalable Bayesian inference

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