Theoretical and methodological aspects of MCMC computations with noisy likelihoods
Andrieu, C., Lee, A., & Vihola, M. (2018). Theoretical and methodological aspects of MCMC computations with noisy likelihoods. In S. A. Sisson, Y. Fan, & M. Beaumont (Eds.), Handbook of Approximate Bayesian Computation : Likelihood-Free Methods for Complex Model (pp. 243-268). Chapman and Hall/CRC. Chapman & Hall/CRC Handbooks of Modern Statistical Methods.
Date
2018Copyright
© the Authors & Chapman and Hall/CRC, 2018.
Approximate Bayesian computation (ABC) [11, 42] is a popular method for Bayesian
inference involving an intractable, or expensive to evaluate, likelihood function but where
simulation from the model is easy. The method consists of defining an alternative likelihood
function which is also in general intractable but naturally lends itself to pseudo-marginal
computations [5], hence making the approach of practical interest. The aim of this chapter
is to show the connections of ABC Markov chain Monte Carlo with pseudo-marginal algorithms,
review their existing theoretical results, and discuss how these can inform practice
and hopefully lead to fruitful methodological developments.
Publisher
Chapman and Hall/CRCParent publication ISBN
978-1-4398-8150-7Is part of publication
Handbook of Approximate Bayesian Computation : Likelihood-Free Methods for Complex ModelPublication in research information system
https://converis.jyu.fi/converis/portal/detail/Publication/28212480
Metadata
Show full item recordCollections
Related funder(s)
Research Council of FinlandFunding program(s)
Academy Research Fellow, AoFLicense
Related items
Showing items with similar title or keywords.
-
A Surrogate-assisted Reference Vector Guided Evolutionary Algorithm for Computationally Expensive Many-objective Optimization
Chugh, Tinkle; Jin, Yaochu; Miettinen, Kaisa; Hakanen, Jussi; Sindhya, Karthik (Institute of Electrical and Electronics Engineers, 2018)We propose a surrogate-assisted reference vector guided evolutionary algorithm (EA) for computationally expensive optimization problems with more than three objectives. The proposed algorithm is based on a recently developed ... -
On the use of approximate Bayesian computation Markov chain Monte Carlo with inflated tolerance and post-correction
Vihola, Matti; Franks, Jordan (Oxford University Press, 2020)Approximate Bayesian computation enables inference for complicated probabilistic models with intractable likelihoods using model simulations. The Markov chain Monte Carlo implementation of approximate Bayesian computation ... -
Parameter estimation for allometric trophic network models : A variational Bayesian inverse problem approach
Tirronen, Maria; Kuparinen, Anna (John Wiley & Sons, 2024)Differential equation models are powerful tools for predicting biological systems, capable of projecting far into the future and incorporating data recorded at arbitrary times. However, estimating these models' parameters ... -
Bayesian semiparametric long memory models for discretized event data
Chakraborty, Antik; Ovaskainen, Otso; Dunson, David B. (Institute of Mathematical Statistics, 2022)We introduce a new class of semiparametric latent variable models for long memory discretized event data. The proposed methodology is motivated by a study of bird vocalizations in the Amazon rain forest; the timings of ... -
Price Optimization Combining Conjoint Data and Purchase History : A Causal Modeling Approach
Valkonen, Lauri; Tikka, Santtu; Helske, Jouni; Karvanen, Juha (University of Pennsylvania Press, 2024)Pricing decisions of companies require an understanding of the causal effect of a price change on the demand. When real-life pricing experiments are infeasible, data-driven decision-making must be based on alternative data ...