4.6 Article

Bayesian Inference Using Synthetic Likelihood: Asymptotics and Adjustments

Journal

Publisher

TAYLOR & FRANCIS INC
DOI: 10.1080/01621459.2022.2086132

Keywords

Approximate Bayesian computation; Likelihood-free inference; Model misspecification

Funding

  1. Australian Research Council's Discovery Early Career Researcher Award funding scheme [DE200101070]
  2. Singapore Ministry of Education Academic Research Fund Tier 1 grant
  3. Australian Research Council Future Fellowship [FT210100260]
  4. Center of Excellence [CE140100049]
  5. Australian Research Council [DE200101070, FT210100260] Funding Source: Australian Research Council

Ask authors/readers for more resources

Implementing Bayesian inference in complex models with difficult likelihood calculations can be challenging. Synthetic likelihood, which constructs an approximate likelihood by simulating from the model, offers a computationally efficient alternative. This article demonstrates that the Bayesian implementation of synthetic likelihood is more efficient than approximate Bayesian computation and provides adjusted inference methods to further speed up computation. Supplementary materials are available online.
Implementing Bayesian inference is often computationally challenging in complex models, especially when calculating the likelihood is difficult. Synthetic likelihood is one approach for carrying out inference when the likelihood is intractable, but it is straightforward to simulate from the model. The method constructs an approximate likelihood by taking a vector summary statistic as being multivariate normal, with the unknown mean and covariance estimated by simulation. Previous research demonstrates that the Bayesian implementation of synthetic likelihood can be more computationally efficient than approximate Bayesian computation, a popular likelihood-free method, in the presence of a high-dimensional summary statistic. Our article makes three contributions. The first shows that if the summary statistics are well-behaved, then the synthetic likelihood posterior is asymptotically normal and yields credible sets with the correct level of coverage. The second contribution compares the computational efficiency of Bayesian synthetic likelihood and approximate Bayesian computation. We show that Bayesian synthetic likelihood is computationally more efficient than approximate Bayesian computation. Based on the asymptotic results, the third contribution proposes using adjusted inference methods when a possibly misspecified form is assumed for the covariance matrix of the synthetic likelihood, such as diagonal or a factor model, to speed up computation. Supplementary materials for this article are available online.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available