Hostname: page-component-74656f9884-c52kr Total loading time: 0 Render date: 2026-11-09T14:43:34.713Z Has data issue: false hasContentIssue false

Hierarchical Approximate Bayesian Computation

Published online by Cambridge University Press:  01 January 2025

Brandon M. Turner*
Affiliation:
Stanford University
Trisha Van Zandt
Affiliation:
The Ohio State University
*
Requests for reprints should be sent to Brandon M. Turner, Stanford University, Stanford, USA. E-mail: turner.826@gmail.com

Abstract

Approximate Bayesian computation (ABC) is a powerful technique for estimating the posterior distribution of a model’s parameters. It is especially important when the model to be fit has no explicit likelihood function, which happens for computational (or simulation-based) models such as those that are popular in cognitive neuroscience and other areas in psychology. However, ABC is usually applied only to models with few parameters. Extending ABC to hierarchical models has been difficult because high-dimensional hierarchical models add computational complexity that conventional ABC cannot accommodate. In this paper, we summarize some current approaches for performing hierarchical ABC and introduce a new algorithm called Gibbs ABC. This new algorithm incorporates well-known Bayesian techniques to improve the accuracy and efficiency of the ABC approach for estimation of hierarchical models. We then use the Gibbs ABC algorithm to estimate the parameters of two models of signal detection, one with and one without a tractable likelihood function.

Information

Type
Original Paper
Copyright
Copyright © 2013 The Psychometric Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable