The correlated pseudomarginal method

被引:61
作者
Deligiannidis, George [1 ]
Doucet, Arnaud [1 ]
Pitt, Michael K. [2 ]
机构
[1] Univ Oxford, Oxford, England
[2] Kings Coll London, London, England
基金
英国工程与自然科学研究理事会;
关键词
Asymptotic posterior normality; Correlated random numbers; Intractable likelihood; Metropolis-Hastings algorithm; Particle filter; Random-effects model; Weak convergence; PARTICLE FILTER; CONVERGENCE; INFERENCE;
D O I
10.1111/rssb.12280
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
The pseudomarginal algorithm is a Metropolis-Hastings-type scheme which samples asymptotically from a target probability density when we can only estimate unbiasedly an unnormalized version of it. In a Bayesian context, it is a state of the art posterior simulation technique when the likelihood function is intractable but can be estimated unbiasedly by using Monte Carlo samples. However, for the performance of this scheme not to degrade as the number T of data points increases, it is typically necessary for the number N of Monte Carlo samples to be proportional to T to control the relative variance of the likelihood ratio estimator appearing in the acceptance probability of this algorithm. The correlated pseudomarginal method is a modification of the pseudomarginal method using a likelihood ratio estimator computed by using two correlated likelihood estimators. For random-effects models, we show under regularity conditions that the parameters of this scheme can be selected such that the relative variance of this likelihood ratio estimator is controlled when N increases sublinearly with T and we provide guidelines on how to optimize the algorithm on the basis of a non-standard weak convergence analysis. The efficiency of computations for Bayesian inference relative to the pseudomarginal method empirically increases with T and exceeds two orders of magnitude in some examples.
引用
收藏
页码:839 / 870
页数:32
相关论文
共 47 条
[1]  
Andrieu C., 2012, J R STAT SOC B, V74, P451
[2]   CONVERGENCE PROPERTIES OF PSEUDO-MARGINAL MARKOV CHAIN MONTE CARLO ALGORITHMS [J].
Andrieu, Christophe ;
Vihola, Matti .
ANNALS OF APPLIED PROBABILITY, 2015, 25 (02) :1030-1077
[3]   Particle Markov chain Monte Carlo methods [J].
Andrieu, Christophe ;
Doucet, Arnaud ;
Holenstein, Roman .
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-STATISTICAL METHODOLOGY, 2010, 72 :269-342
[4]   THE PSEUDO-MARGINAL APPROACH FOR EFFICIENT MONTE CARLO COMPUTATIONS [J].
Andrieu, Christophe ;
Roberts, Gareth O. .
ANNALS OF STATISTICS, 2009, 37 (02) :697-725
[5]  
[Anonymous], 2004, PROB APPL S
[6]  
[Anonymous], 1992, Statistical Science, DOI [10.1214/ss/1177011137, DOI 10.1214/SS/1177011137]
[7]  
Beaumont MA, 2003, GENETICS, V164, P1139
[8]   A lognormal central limit theorem for particle approximations of normalizing constants [J].
Berard, Jean ;
Del Moral, Pierre ;
Doucet, Arnaud .
ELECTRONIC JOURNAL OF PROBABILITY, 2014, 19 :1-28
[9]  
Berti Patrizia, 2006, Stochastics and Stochastics Reports, V78, P91
[10]   Improved particle filter for nonlinear problems [J].
Carpenter, J ;
Clifford, P ;
Fearnhead, P .
IEE PROCEEDINGS-RADAR SONAR AND NAVIGATION, 1999, 146 (01) :2-7