{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T22:18:38Z","timestamp":1772662718415,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T00:00:00Z","timestamp":1684022400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T00:00:00Z","timestamp":1684022400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1903139"],"award-info":[{"award-number":["DMS-1903139"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2015411"],"award-info":[{"award-number":["DMS-2015411"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Stat Comput"],"published-print":{"date-parts":[[2023,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The multiple-try Metropolis method is an interesting extension of the classical Metropolis\u2013Hastings algorithm. However, theoretical understanding about its usefulness and convergence behavior is still lacking. We here derive the exact convergence rate for the multiple-try Metropolis Independent sampler (MTM-IS) via an explicit eigen analysis. As a by-product, we prove that an naive application of the MTM-IS is less efficient than using the simpler approach of \u201cthinned\u201d independent Metropolis\u2013Hastings method at the same computational cost. We further explore more variants and find it possible to design more efficient algorithms by applying MTM to part of the target distribution or creating correlated multiple trials.<\/jats:p>","DOI":"10.1007\/s11222-023-10241-3","type":"journal-article","created":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T12:33:33Z","timestamp":1684154013000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Convergence rate of multiple-try Metropolis independent sampler"],"prefix":"10.1007","volume":"33","author":[{"given":"Xiaodong","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4450-7239","authenticated-orcid":false,"given":"Jun S.","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,14]]},"reference":[{"issue":"1","key":"10241_CR1","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1080\/10485250601033214","volume":"41","author":"YF Atchad\u00e9","year":"2007","unstructured":"Atchad\u00e9, Y.F., Perron, F.: On the geometric ergodicity of metropolis-hastings algorithms. Statistics 41(1), 77\u201384 (2007)","journal-title":"Statistics"},{"key":"10241_CR2","doi-asserted-by":"crossref","unstructured":"B\u00e9dard, M., Douc, R., Moulines, E.: Scaling analysis of multiple-try mcmc methods. Stoch. Process. Appl. 122(3), 758\u2013786 (2012)","DOI":"10.1016\/j.spa.2011.11.004"},{"key":"10241_CR3","doi-asserted-by":"publisher","DOI":"10.1201\/b10905","volume-title":"Handbook of Markov Chain Monte Carlo","author":"S Brooks","year":"2011","unstructured":"Brooks, S., Gelman, A., Jones, G., Meng, X.-L.: Handbook of Markov Chain Monte Carlo. CRC Press (2011)"},{"issue":"49","key":"10241_CR4","doi-asserted-by":"publisher","first-page":"17408","DOI":"10.1073\/pnas.1408184111","volume":"111","author":"B Calderhead","year":"2014","unstructured":"Calderhead, B.: A general construction for parallelizing metropolis-hastings algorithms. Proc. Natl. Acad. Sci. 111(49), 17408\u201317413 (2014)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"2","key":"10241_CR5","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s11222-011-9301-9","volume":"23","author":"R Casarin","year":"2013","unstructured":"Casarin, R., Craiu, R., Leisen, F.: Interacting multiple try algorithms with different proposal distributions. Stat. Comput. 23(2), 185\u2013200 (2013)","journal-title":"Stat. Comput."},{"issue":"3","key":"10241_CR6","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1093\/biomet\/81.3.457","volume":"81","author":"X-H Chen","year":"1994","unstructured":"Chen, X.-H., Dempster, A.P., Liu, J.S.: Weighted finite population sampling to maximize entropy. Biometrika 81(3), 457\u2013469 (1994)","journal-title":"Biometrika"},{"issue":"2","key":"10241_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s11222-006-9009-4","volume":"17","author":"RV Craiu","year":"2007","unstructured":"Craiu, R.V., Lemieux, C.: Acceleration of the multiple-try metropolis algorithm using antithetic and stratified sampling. Stat. Comput. 17(2), 109\u2013120 (2007)","journal-title":"Stat. Comput."},{"key":"10241_CR8","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1080\/01621459.2020.1811100","volume":"117","author":"C Dai","year":"2020","unstructured":"Dai, C., Liu, J.S.: Monte Carlo approximation of bayes factors via mixing with surrogate distributions. J. Am. Stat. Assoc. 117, 765 (2020)","journal-title":"J. Am. Stat. Assoc."},{"issue":"2","key":"10241_CR9","first-page":"151","volume":"23","author":"P Diaconis","year":"2008","unstructured":"Diaconis, P., Khare, K., Saloff-Coste, L.: Gibbs sampling, exponential families and orthogonal polynomials. Stat. Sci. 23(2), 151\u2013178 (2008)","journal-title":"Stat. Sci."},{"issue":"1","key":"10241_CR10","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1006\/jcss.1998.1576","volume":"57","author":"P Diaconis","year":"1998","unstructured":"Diaconis, P., Saloff-Coste, L.: What do we know about the metropolis algorithm? J. Comput. Syst. Sci. 57(1), 20\u201336 (1998)","journal-title":"J. Comput. Syst. Sci."},{"key":"10241_CR11","volume-title":"Understanding Molecular Simulation: from Algorithms to Applications","author":"D Frenkel","year":"1996","unstructured":"Frenkel, D., Smit, B., Ratner, M.A.: Understanding Molecular Simulation: from Algorithms to Applications. Academic press San Diego (1996)"},{"key":"10241_CR12","doi-asserted-by":"crossref","unstructured":"Hastings, W.K.: Monte carlo sampling methods using markov chains and their applications (1970)","DOI":"10.1093\/biomet\/57.1.97"},{"key":"10241_CR13","doi-asserted-by":"publisher","DOI":"10.1090\/mbk\/107","volume-title":"Markov Chains and Mixing Times","author":"DA Levin","year":"2017","unstructured":"Levin, D.A., Peres, Y.: Markov Chains and Mixing Times, vol. 107. American Mathematical Soc (2017)"},{"issue":"2","key":"10241_CR14","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF00162521","volume":"6","author":"JS Liu","year":"1996","unstructured":"Liu, J.S.: Metropolized independent sampling with comparisons to rejection sampling and importance sampling. Stat. Comput. 6(2), 113\u2013119 (1996)","journal-title":"Stat. Comput."},{"key":"10241_CR15","volume-title":"Monte Carlo Strategies in Scientific Computing","author":"JS Liu","year":"2008","unstructured":"Liu, J.S.: Monte Carlo Strategies in Scientific Computing. Springer (2008)"},{"issue":"449","key":"10241_CR16","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1080\/01621459.2000.10473908","volume":"95","author":"JS Liu","year":"2000","unstructured":"Liu, J.S., Liang, F., Wong, W.H.: The multiple-try method and local optimization in metropolis sampling. J. Am. Stat. Assoc. 95(449), 121\u2013134 (2000)","journal-title":"J. Am. Stat. Assoc."},{"issue":"1","key":"10241_CR17","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1111\/j.2517-6161.1995.tb02021.x","volume":"57","author":"JS Liu","year":"1995","unstructured":"Liu, J.S., Wong, W.H., Kong, A.: Covariance structure and convergence rate of the gibbs sampler with various scans. J. R. Stat. Soc. Ser. B 57(1), 157\u2013169 (1995)","journal-title":"J. R. Stat. Soc. Ser. B"},{"key":"10241_CR18","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.dsp.2018.01.004","volume":"75","author":"L Martino","year":"2018","unstructured":"Martino, L.: A review of multiple try mcmc algorithms for signal processing. Digit. Signal Process. 75, 134\u2013152 (2018)","journal-title":"Digit. Signal Process."},{"key":"10241_CR19","unstructured":"Martino, L., Leisen, F., Corander, J.: On multiple try schemes and the particle metropolis-hastings algorithm. arXiv preprint arXiv:1409.0051 (2014)"},{"issue":"6","key":"10241_CR20","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21(6), 1087\u20131092 (1953)","journal-title":"J. Chem. Phys."},{"key":"10241_CR21","unstructured":"Neal, R.M.: Mcmc using ensembles of states for problems with fast and slow variables such as gaussian process regression. arXiv preprint arXiv:1101.0387 (2011)"},{"key":"10241_CR22","unstructured":"Pandolfi, S., Bartolucci, F., Friel, N.: A generalization of the multiple-try metropolis algorithm for bayesian estimation and model selection. In: Proceedings of the thirteenth international conference on artificial intelligence and statistics, pages 581\u2013588. JMLR Workshop and Conference Proceedings (2010)"},{"issue":"2","key":"10241_CR23","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1006\/jcph.2001.6860","volume":"172","author":"ZS Qin","year":"2001","unstructured":"Qin, Z.S., Liu, J.S.: Multipoint metropolis method with application to hybrid monte Carlo. J. Comput. Phys. 172(2), 827\u2013840 (2001)","journal-title":"J. Comput. Phys."},{"issue":"1","key":"10241_CR24","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1093\/biomet\/83.1.95","volume":"83","author":"GO Roberts","year":"1996","unstructured":"Roberts, G.O., Tweedie, R.L.: Geometric convergence and central limit theorems for multidimensional hastings and metropolis algorithms. Biometrika 83(1), 95\u2013110 (1996)","journal-title":"Biometrika"},{"key":"10241_CR25","first-page":"1701","volume":"22","author":"L Tierney","year":"1994","unstructured":"Tierney, L.: Markov chains for exploring posterior distributions. Ann. Stat. 22, 1701\u20131728 (1994)","journal-title":"Ann. Stat."},{"key":"10241_CR26","unstructured":"Wang, G.: Exact convergence analysis of the independent metropolis-hastings algorithms. arXiv preprint arXiv:2008.02455 (2020)"},{"issue":"5","key":"10241_CR27","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1007\/s11222-017-9780-4","volume":"28","author":"S Yang","year":"2018","unstructured":"Yang, S., Chen, Y., Bernton, E., Liu, J.S.: On parallelizable Markov chain monte Carlo algorithms with waste-recycling. Stat. Comput. 28(5), 1073\u20131081 (2018)","journal-title":"Stat. Comput."}],"container-title":["Statistics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-023-10241-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11222-023-10241-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-023-10241-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,20]],"date-time":"2024-10-20T10:49:00Z","timestamp":1729421340000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11222-023-10241-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,14]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["10241"],"URL":"https:\/\/doi.org\/10.1007\/s11222-023-10241-3","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"value":"0960-3174","type":"print"},{"value":"1573-1375","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,14]]},"assertion":[{"value":"15 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests that are directly or indirectly related to the work submitted for publication.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"79"}}