Leave Pima Indians alone: binary regression as a benchmark for Bayesian computation

Abstract

Abstract. Whenever a new approach to perform Bayesian computation is introduced, a common practice is to showcase this approach on a binary regression model and datasets of moderate size. This paper discusses to which extent this practice is sound. It also reviews the current state of the art of Bayesian computation, using binary regression as a running example. Both sampling-based algorithms (importance sampling, MCMC and SMC) and fast approximations (Laplace and EP) are covered. Extensive numerical results are provided, some of which might go against conventional wisdom regarding the effectiveness of certain algorithms. Implications for other problems (variable selection) and other models are also discussed.

References in corpus (4)

• A weakly informative default prior distribution for logistic and other regression models
• On the utility of graphics cards to perform massively parallel simulation of advanced Monte Carlo methods
• On Markov chain Monte Carlo methods for tall data
• Fast simulation of truncated Gaussian distributions

Cited by in corpus (9)

• Discontinuous Hamiltonian Monte Carlo for discrete parameters and discontinuous likelihoods
• Conjugate Bayes for probit regression via unified skew-normal distributions
• A Class of Conjugate Priors for Multinomial Probit Models which Includes the Multivariate Normal One
• A closed-form filter for binary time series
• JAGS, NIMBLE, Stan: a detailed comparison among Bayesian MCMC software
• On a Metropolis-Hastings importance sampling estimator
• Online Sampling from Log-Concave Distributions
• Entropy-based adaptive Hamiltonian Monte Carlo
• Scalable couplings for the random walk Metropolis algorithm