A computational framework for empirical Bayes inference

作者：Atchade Yves F^*

来源：Statistics and Computing, 2011, 21(4): 463-473.

DOI：10.1007/s11222-010-9182-3

• Empirical Bayes
• Adaptive MCMC
• Variable selection
• Bayesian LASSO

In empirical Bayes inference one is typically interested in sampling from the posterior distribution of a parameter with a hyper-parameter set to its maximum likelihood estimate. This is often problematic particularly when the likelihood function of the hyper-parameter is not available in closed form and the posterior distribution is intractable. Previous works have dealt with this problem using a multi-step approach based on the EM algorithm and Markov Chain Monte Carlo (MCMC). We propose a framework based on recent developments in adaptive MCMC, where this problem is addressed more efficiently using a single Monte Carlo run. We discuss the convergence of the algorithm and its connection with the EM algorithm. We apply our algorithm to the Bayesian Lasso of Park and Casella (J. Am. Stat. Assoc. 103:681-686, 2008) and on the empirical Bayes variable selection of George and Foster (J. Am. Stat. Assoc. 87:731-747, 2000).

• 出版日期2011-10