2015/06/29 by ChopinNicolas, Chopin, Nicolas, James Ridgway +1 · 3 citations
Computer Science · Mathematics · #Bayesian Methods and Mixture Models #Computation (stat.CO) #FOS: Computer and information sciences #Markov Chains and Monte Carlo Methods #Methodology (stat.ME) #Statistical Methods and Bayesian Inference
paper · pdf · doi:10.48550/arxiv.1506.08640
openalex publication_date 2015/06/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Abstract. Whenever a new approach to perform Bayesian computation is\nintroduced, a common practice is to showcase this approach on a binary\nregression model and datasets of moderate size. This paper discusses to which\nextent this practice is sound. It also reviews the current state of the art of\nBayesian computation, using binary regression as a running example. Both\nsampling-based algorithms (importance sampling, MCMC and SMC) and fast\napproximations (Laplace and EP) are covered. Extensive numerical results are\nprovided, some of which might go against conventional wisdom regarding the\neffectiveness of certain algorithms. Implications for other problems (variable\nselection) and other models are also discussed.\n