Adaptive Markov chain Monte Carlo algorithms for Bayesian inference: recent advances and comparative study. Issue 11 (2nd November 2019)

• Record Type: Journal Article
• Authors: Jin, Seung-Seop; Ju, Heekun; Jung, Hyung-Jo
• Is Part Of: Structure and infrastructure engineering. Volume 15:Issue 11(2019)
• Page Start: 1548
• Page End: 1565
• Publication Date: 2019-11-02
• Subjects: Parameter estimation -- Bayesian inference -- Markov Chain Monte Carlo algorithm -- adaptive proposal mechanism -- sampling performance; Structural analysis (Engineering) -- Periodicals; Structural engineering -- Periodicals; Buildings -- Performance -- Periodicals; 620.005
• DOI: 10.1080/15732479.2019.1628077
• Languages: English
• ISSNs: 1573-2479

Abstract

Abstract: Condition assessments of structures require prediction models such as empirical model and numerical simulation model. Generally, these prediction models have model parameters to be estimated from experimental data. Bayesian inference is the formal statistical framework to estimate the model parameters and their uncertainties. As a result, uncertainties associated with the model and measurement can be accounted for decision making. Markov Chain Monte Carlo (MCMC) algorithms have been widely employed. However, there still remain some implementation issues from the inappropriate selection of the proposal mechanism in Markov chain. Since the posterior density for a given problem is often problem-dependent and unknown, users require a trial-and-error approach to select and tune optimal proposal mechanism. To relieve this difficulty, various adaptive MCMC algorithms have been recently appeared. Users must understand their mechanism and limitations before applying the algorithms to their problems. However, there is no comprehensive work to provide detailed exposition and their performance comparison together. This study aims to bring together different adaptive MCMC algorithms with the goal of providing their mechanisms and evaluating their performances through comparative study. Three algorithms are chosen as the representative proposal mechanism. From comparative studies, the discussions were drawn in terms of performances, simplicity and computational costs for less-experienced users.