Stochastic approximation Monte Carlo importance sampling for approximating exact conditional probabilities

被引:0
作者
Sooyoung Cheon
Faming Liang
Yuguo Chen
Kai Yu
机构
[1] Korea University,Department of Informational Statistics
[2] Texas A&M University,Department of Statistics
[3] University of Illinois at Urbana-Champaign,Department of Statistics
[4] National Cancer Institute,Division of Cancer Epidemiology & Genetics
来源
Statistics and Computing | 2014年 / 24卷
关键词
Contingency table; Exact inference; Importance sampling; MCMC; Stochastic approximation Monte Carlo;
D O I
暂无
中图分类号
学科分类号
摘要
Importance sampling and Markov chain Monte Carlo methods have been used in exact inference for contingency tables for a long time, however, their performances are not always very satisfactory. In this paper, we propose a stochastic approximation Monte Carlo importance sampling (SAMCIS) method for tackling this problem. SAMCIS is a combination of adaptive Markov chain Monte Carlo and importance sampling, which employs the stochastic approximation Monte Carlo algorithm (Liang et al., J. Am. Stat. Assoc., 102(477):305–320, 2007) to draw samples from an enlarged reference set with a known Markov basis. Compared to the existing importance sampling and Markov chain Monte Carlo methods, SAMCIS has a few advantages, such as fast convergence, ergodicity, and the ability to achieve a desired proportion of valid tables. The numerical results indicate that SAMCIS can outperform the existing importance sampling and Markov chain Monte Carlo methods: It can produce much more accurate estimates in much shorter CPU time than the existing methods, especially for the tables with high degrees of freedom.
引用
收藏
页码:505 / 520
页数:15
相关论文
共 84 条
[1]  
Andrieu C.(2005)Stability of stochastic approximation under verifiable conditions SIAM J. Control Optim. 44 283-312
[2]  
Moulines a.(2010)The Wang-Landau algorithm for Monte Carlo computation in general state spaces Stat. Sin. 20 209-233
[3]  
Priouret P.(1988)Methods for the analysis of contingency tables with large and small cell counts J. Am. Stat. Assoc. 83 1006-1013
[4]  
Atchadé Y.F.(1991)Multicanonical algorithms for first order phase transitions Phys. Lett. B 267 249-252
[5]  
Liu J.S.(2009)Efficient importance sampling for binary contingency tables Ann. Appl. Probab. 19 949-982
[6]  
Baglivo J.(1999)An importance sampling algorithm for exact conditional test in log-linear models Biometrika 86 321-332
[7]  
Oliver D.(2008)An efficient algorithm for rate-event probability estimation, combinatorial optimization, and counting Methodol. Comput. Appl. Probab. 10 471-505
[8]  
Pagano M.(2001)A Markov chain Monte Carlo algorithm for approximating exact conditional probabilities J. Comput. Graph. Stat. 10 730-745
[9]  
Berg B.A.(2005)Sequential Monte Carlo methods for statistical analysis of table J. Am. Stat. Assoc. 100 109-120
[10]  
Neuhaus T.(2006)Sequential importance sampling for multiway tables Ann. Stat. 34 523-545