2019
DOI: 10.1080/10618600.2018.1537928
|View full text |Cite
|
Sign up to set email alerts
|

Accelerating Bayesian Synthetic Likelihood With the Graphical Lasso

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
25
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 23 publications
(25 citation statements)
references
References 12 publications
0
25
0
Order By: Relevance
“…A key feature of the proposed method is the automated selection and combination of summary statistics from a large pool of candidates. While there are several works on summary statistics selection in the framework of approximate Bayesian computation (Aeschbacher et al, 2012;Fearnhead and Prangle, 2012;Blum et al, 2013;Gutmann et al, 2014;Marin et al, 2016;Gutmann et al, 2018;Jiang et al, 2018), there is comparably little corresponding work on synthetic likelihood (Wood, 2010) with the exception of the recent work by An et al (2019) and Ong et al (2018) whose robust estimation techniques of the (inverse) covariance matrix are broadly related to summary statistics selection. We have shown that synthetic likelihood is a special case of the proposed approach so that our techniques for summary statistics selection could also be used there.…”
Section: Discussionmentioning
confidence: 99%
See 2 more Smart Citations
“…A key feature of the proposed method is the automated selection and combination of summary statistics from a large pool of candidates. While there are several works on summary statistics selection in the framework of approximate Bayesian computation (Aeschbacher et al, 2012;Fearnhead and Prangle, 2012;Blum et al, 2013;Gutmann et al, 2014;Marin et al, 2016;Gutmann et al, 2018;Jiang et al, 2018), there is comparably little corresponding work on synthetic likelihood (Wood, 2010) with the exception of the recent work by An et al (2019) and Ong et al (2018) whose robust estimation techniques of the (inverse) covariance matrix are broadly related to summary statistics selection. We have shown that synthetic likelihood is a special case of the proposed approach so that our techniques for summary statistics selection could also be used there.…”
Section: Discussionmentioning
confidence: 99%
“…The cross-validation adds computational cost and the dependency of λ min on θ can make more detailed theoretical investigations more difficult. In order to reduce the cost or to facilitate theoretical analyses, working with a fixed value of λ as, for example, An et al (2019) for synthetic likelihood with the graphical lasso may be appropriate.…”
Section: Data-driven Selection Of Summary Statisticsmentioning
confidence: 99%
See 1 more Smart Citation
“…Despite the relative advantages and efficiencies of BSL, and recent work in this area (e.g. Nott et al, 2019;An et al, 2019b;Ong et al, 2018b) there remain some key inefficiencies in the method. Most prominently, for a Gaussian synthetic likelihood the unknown mean and covariance matrix must be estimated by simulation for every proposed parameter within any inference algorithm.…”
Section: Introductionmentioning
confidence: 99%
“…A number of efficient covariance matrix estimation techniques have been considered to reduce the needed number of model simulations in BSL. An et al (2019b) use the graphical lasso to provide a sparse estimate of the precision matrix. However, performance is inhibited when there is a low degree of sparsity in the covariance or inverse covariance matrix.…”
Section: Introductionmentioning
confidence: 99%