2 code implementations • 3 Feb 2021 • Hongsheng Dai, Murray Pollock, Gareth Roberts
By means of extensive guidance on the implementation of the approach, we demonstrate theoretically and empirically that Bayesian Fusion is robust to increasing numbers of analyses, and coherently unifying analyses which do not concur.
Methodology
2 code implementations • ICML 2020 • Joris Bierkens, Sebastiano Grazzi, Kengo Kamatani, Gareth Roberts
We demonstrate theoretically and empirically that we can also construct a control-variate subsampling boomerang sampler which is also exact, and which possesses remarkable scaling properties in the large data limit.
1 code implementation • 1 May 2018 • Giacomo Zanella, Gareth Roberts
We propose a Monte Carlo algorithm to sample from high dimensional probability distributions that combines Markov chain Monte Carlo and importance sampling.
4 code implementations • 16 Jan 2017 • Joris Bierkens, Alexandre Bouchard-Côté, Arnaud Doucet, Andrew B. Duncan, Paul Fearnhead, Thibaut Lienart, Gareth Roberts, Sebastian J. Vollmer
Piecewise Deterministic Monte Carlo algorithms enable simulation from a posterior distribution, whilst only needing to access a sub-sample of data at each iteration.
Methodology Computation
6 code implementations • 11 Jul 2016 • Joris Bierkens, Paul Fearnhead, Gareth Roberts
Standard MCMC methods can scale poorly to big data settings due to the need to evaluate the likelihood at each iteration.
Computation Probability 65C60, 65C05, 62F15, 60J25