In this technical note we compare the performance of four gradient-free MCMC samplers (random walk Metropolis sampling, slice-sampling, adaptive MCMC sampling and population-based MCMC sampling with tempering) in terms of the number of independent samples they can produce per unit computational time. For the Bayesian inversion of a single-node neural mass model, both adaptive and population-based samplers are more efficient compared with random walk Metropolis sampler or slice-sampling; yet adaptive MCMC sampling is more promising in terms of compute time. Slice-sampling yields the highest number of independent samples from the target density - albeit at almost 1000% increase in computational time, in comparison to the most efficient algorithm (i.e., the adaptive MCMC sampler).
Davey L Jones, Jasmine M. S. Grimsley, Jessica L. Kevill, Rachel Williams, Cameron Pellett, Kathryn Lambert-Slosarska, Andrew C. Singer, Gwion B. Williams, Rafael Bargiela, Robert W. Brown, Matthew J. Wade, Kata Farkas
Karl Friston, Thomas Parr, Peter Zeidman, Adeel Razi, Guillaume Flandin, Jean Daunizeau, Oliver J. Hulme, Alexander J. Billig, Vladimir Litvak, Rosalyn Moran, Cathy J. Price, Christian Lambert
Karl Friston, Thomas Parr, Peter Zeidman, Adeel Razi, Guillaume Flandin, Jean Daunizeau, Oliver J. Hulme, Alexander J. Billig, Vladimir Litvak, Rosalyn Moran, Cathy J. Price, Christian Lambert
Karl Friston, Thomas Parr, Peter Zeidman, Adeel Razi, Guillaume Flandin, Jean Daunizeau, Oliver J. Hulme, Alexander J. Billig, Vladimir Litvak, Rosalyn Moran, Cathy J. Price, Christian Lambert
Discussion(0)
No comments yet. Be the first to comment.