Picture for Chris Sherlock

Chris Sherlock

Scalable Monte Carlo for Bayesian Learning

Add code
Jul 17, 2024
Viaarxiv icon

SwISS: A Scalable Markov chain Monte Carlo Divide-and-Conquer Strategy

Add code
Aug 08, 2022
Figure 1 for SwISS: A Scalable Markov chain Monte Carlo Divide-and-Conquer Strategy
Figure 2 for SwISS: A Scalable Markov chain Monte Carlo Divide-and-Conquer Strategy
Figure 3 for SwISS: A Scalable Markov chain Monte Carlo Divide-and-Conquer Strategy
Figure 4 for SwISS: A Scalable Markov chain Monte Carlo Divide-and-Conquer Strategy
Viaarxiv icon

Bounds on Wasserstein distances between continuous distributions using independent samples

Add code
Mar 22, 2022
Figure 1 for Bounds on Wasserstein distances between continuous distributions using independent samples
Figure 2 for Bounds on Wasserstein distances between continuous distributions using independent samples
Figure 3 for Bounds on Wasserstein distances between continuous distributions using independent samples
Figure 4 for Bounds on Wasserstein distances between continuous distributions using independent samples
Viaarxiv icon

Merging MCMC Subposteriors through Gaussian-Process Approximations

Add code
Jul 17, 2017
Figure 1 for Merging MCMC Subposteriors through Gaussian-Process Approximations
Figure 2 for Merging MCMC Subposteriors through Gaussian-Process Approximations
Figure 3 for Merging MCMC Subposteriors through Gaussian-Process Approximations
Figure 4 for Merging MCMC Subposteriors through Gaussian-Process Approximations
Viaarxiv icon

Particle Metropolis-adjusted Langevin algorithms

Add code
May 27, 2016
Figure 1 for Particle Metropolis-adjusted Langevin algorithms
Figure 2 for Particle Metropolis-adjusted Langevin algorithms
Figure 3 for Particle Metropolis-adjusted Langevin algorithms
Figure 4 for Particle Metropolis-adjusted Langevin algorithms
Viaarxiv icon