{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T14:30:05Z","timestamp":1781188205667,"version":"3.54.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,8,15]],"date-time":"2021-08-15T00:00:00Z","timestamp":1628985600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,8,15]],"date-time":"2021-08-15T00:00:00Z","timestamp":1628985600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["853291"],"award-info":[{"award-number":["853291"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Royal Society University Research Fellow"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Stat Comput"],"published-print":{"date-parts":[[2021,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Slice sampling has emerged as a powerful Markov Chain Monte Carlo algorithm that adapts to the characteristics of the target distribution with minimal hand-tuning. However, Slice Sampling\u2019s performance is highly sensitive to the user-specified initial length scale hyperparameter and the method generally struggles with poorly scaled or strongly correlated distributions. This paper introduces Ensemble Slice Sampling (ESS), a new class of algorithms that bypasses such difficulties by adaptively tuning the initial length scale and utilising an ensemble of parallel walkers in order to efficiently handle strong correlations between parameters. These affine-invariant algorithms are trivial to construct, require no hand-tuning, and can easily be implemented in parallel computing environments. Empirical tests show that Ensemble Slice Sampling can improve efficiency by more than an order of magnitude compared to conventional MCMC methods on a broad range of highly correlated target distributions. In cases of strongly multimodal target distributions, Ensemble Slice Sampling can sample efficiently even in high dimensions. We argue that the parallel, black-box and gradient-free nature of the method renders it ideal for use in scientific fields such as physics, astrophysics and cosmology which are dominated by a wide variety of computationally expensive and non-differentiable models.<\/jats:p>","DOI":"10.1007\/s11222-021-10038-2","type":"journal-article","created":{"date-parts":[[2021,8,15]],"date-time":"2021-08-15T03:49:31Z","timestamp":1628999371000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":45,"title":["Ensemble slice sampling"],"prefix":"10.1007","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9489-4612","authenticated-orcid":false,"given":"Minas","family":"Karamanis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Florian","family":"Beutler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,8,15]]},"reference":[{"key":"10038_CR1","unstructured":"Betancourt, M.: A conceptual introduction to Hamiltonian Monte Carlo. arXiv preprint arXiv:170102434 (2017)"},{"key":"10038_CR2","unstructured":"Bishop, C.M.: Pattern recognition. Mach. Learn. 128(9), (2006)"},{"issue":"3","key":"10038_CR3","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1111\/j.1467-9868.2006.00553.x","volume":"68","author":"P Del Moral","year":"2006","unstructured":"Del Moral, P., Doucet, A., Jasra, A.: Sequential Monte Carlo samplers. J. R. Stat. Soc. Ser. B (Stat. Methodol.) 68(3), 411\u2013436 (2006)","journal-title":"J. R. Stat. Soc. Ser. B (Stat. Methodol.)"},{"issue":"1","key":"10038_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the EM algorithm. J. R. Stat. Soc. Ser. B (Methodol.) 39(1), 1\u201322 (1977)","journal-title":"J. R. Stat. Soc. Ser. B (Methodol.)"},{"key":"10038_CR5","unstructured":"Farr. B, Farr, W.M.: Kombine: a kernel-density-based, embarrassingly parallel ensemble sampler. (2015) https:\/\/github.com\/bfarr\/kombine"},{"issue":"2","key":"10038_CR6","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1111\/j.1365-2966.2007.12353.x","volume":"384","author":"F Feroz","year":"2008","unstructured":"Feroz, F., Hobson, M.P.: Multimodal nested sampling: an efficient and robust alternative to Markov chain Monte Carlo methods for astronomical data analyses. Mon. Not. R. Astron. Soc. 384(2), 449\u2013463 (2008)","journal-title":"Mon. Not. R. Astron. Soc."},{"key":"10038_CR7","unstructured":"Foreman-Mackey, D.: Autocorrelation analysis & convergence\u2014EMCEE 3.0.2 documentation. (2019) https:\/\/emcee.readthedocs.io\/en\/stable\/tutorials\/autocorr\/"},{"issue":"925","key":"10038_CR8","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1086\/670067","volume":"125","author":"D Foreman-Mackey","year":"2013","unstructured":"Foreman-Mackey, D., Hogg, D.W., Lang, D., Goodman, J.: EMCEE: the MCMC hammer. Publ. Astron. Soc. Pac. 125(925), 306 (2013)","journal-title":"Publ. Astron. Soc. Pac."},{"issue":"1","key":"10038_CR9","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1137\/19M1251655","volume":"19","author":"A Garbuno-Inigo","year":"2020","unstructured":"Garbuno-Inigo, A., Hoffmann, F., Li, W., Stuart, A.M.: Interacting Langevin diffusions: gradient structure and ensemble Kalman sampler. SIAM J. Appl. Dyn. Syst. 19(1), 412\u2013441 (2020a)","journal-title":"SIAM J. Appl. Dyn. Syst."},{"issue":"3","key":"10038_CR10","doi-asserted-by":"publisher","first-page":"1633","DOI":"10.1137\/19M1304891","volume":"19","author":"A Garbuno-Inigo","year":"2020","unstructured":"Garbuno-Inigo, A., N\u00fcsken, N., Reich, S.: Affine invariant interacting Langevin dynamics for Bayesian inference. SIAM J. Appl. Dyn. Syst. 19(3), 1633\u20131658 (2020b)","journal-title":"SIAM J. Appl. Dyn. Syst."},{"issue":"1","key":"10038_CR11","first-page":"179","volume":"43","author":"WR Gilks","year":"1994","unstructured":"Gilks, W.R., Roberts, G.O., George, E.I.: Adaptive direction sampling. J. R. Stat. Soc. Ser. D (The Statistician) 43(1), 179\u2013189 (1994)","journal-title":"J. R. Stat. Soc. Ser. D (The Statistician)"},{"issue":"1","key":"10038_CR12","doi-asserted-by":"publisher","first-page":"65","DOI":"10.2140\/camcos.2010.5.65","volume":"5","author":"J Goodman","year":"2010","unstructured":"Goodman, J., Weare, J.: Ensemble samplers with affine invariance. Commun. Appl. Math. Comput. Sci. 5(1), 65\u201380 (2010)","journal-title":"Commun. Appl. Math. Comput. Sci."},{"issue":"4","key":"10038_CR13","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/s11390-010-9355-8","volume":"25","author":"D G\u00f6r\u00fcr","year":"2010","unstructured":"G\u00f6r\u00fcr, D., Rasmussen, C.E.: Dirichlet process Gaussian mixture models: choice of the base distribution. J. Comput. Sci. Technol. 25(4), 653\u2013664 (2010)","journal-title":"J. Comput. Sci. Technol."},{"issue":"2","key":"10038_CR14","doi-asserted-by":"publisher","first-page":"223","DOI":"10.2307\/3318737","volume":"7","author":"H Haario","year":"2001","unstructured":"Haario, H., Saksman, E., Tamminen, J., et al.: An adaptive metropolis algorithm. Bernoulli 7(2), 223\u2013242 (2001)","journal-title":"Bernoulli"},{"issue":"1","key":"10038_CR15","first-page":"1593","volume":"15","author":"MD Hoffman","year":"2014","unstructured":"Hoffman, M.D., Gelman, A.: The no-u-turn sampler: adaptively setting path lengths in Hamiltonian Monte Carlo. J. Mach. Learn. Res. 15(1), 1593\u20131623 (2014)","journal-title":"J. Mach. Learn. Res."},{"issue":"05","key":"10038_CR16","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1142\/S0129183101001912","volume":"12","author":"Y Iba","year":"2001","unstructured":"Iba, Y.: Extended ensemble Monte Carlo. Int. J. Mod. Phys. C 12(05), 623\u2013656 (2001)","journal-title":"Int. J. Mod. Phys. C"},{"key":"10038_CR17","doi-asserted-by":"crossref","unstructured":"Karamanis, M., Beutler, F., Peacock, J.A.: Zeus: a python implementation of ensemble slice sampling for efficient Bayesian parameter inference. arXiv preprint arXiv:210503468 (2021)","DOI":"10.1007\/s11222-021-10038-2"},{"key":"10038_CR18","unstructured":"Keeling, C.D., Whorf, T.P.: Atmospheric CO2 concentrations derived from flask air samples at sites in the SiO network. Trends: a compendium of data on Global Change (2004)"},{"issue":"2","key":"10038_CR19","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s11222-017-9730-1","volume":"28","author":"B Leimkuhler","year":"2018","unstructured":"Leimkuhler, B., Matthews, C., Weare, J.: Ensemble preconditioning for Markov chain Monte Carlo simulation. Stat. Comput. 28(2), 277\u2013290 (2018)","journal-title":"Stat. Comput."},{"issue":"443","key":"10038_CR20","doi-asserted-by":"publisher","first-page":"1032","DOI":"10.1080\/01621459.1998.10473765","volume":"93","author":"JS Liu","year":"1998","unstructured":"Liu, J.S., Chen, R.: Sequential Monte Carlo methods for dynamic systems. J. Am. Stat. Assoc. 93(443), 1032\u20131044 (1998)","journal-title":"J. Am. Stat. Assoc."},{"key":"10038_CR21","volume-title":"Information Theory, Inference and Learning Algorithms","author":"DJ MacKay","year":"2003","unstructured":"MacKay, D.J.: Information Theory, Inference and Learning Algorithms. Cambridge University Press, Cambridge (2003)"},{"key":"10038_CR22","unstructured":"Murray, I., Adams, R., MacKay, D.: Elliptical slice sampling. In: Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics, JMLR Workshop and Conference Proceedings, pp. 541\u2013548 (2010)"},{"key":"10038_CR23","doi-asserted-by":"crossref","unstructured":"Neal, R.M.: Slice sampling. Ann. Stat. pp. 705\u2013741 (2003)","DOI":"10.1214\/aos\/1056562461"},{"issue":"11","key":"10038_CR24","first-page":"2","volume":"2","author":"RM Neal","year":"2011","unstructured":"Neal, R.M., et al.: MCMC using Hamiltonian dynamics. Handbook of Markov chain Monte Carlo 2(11), 2 (2011)","journal-title":"Handbook of Markov chain Monte Carlo"},{"issue":"1","key":"10038_CR25","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10107-007-0149-x","volume":"120","author":"Y Nesterov","year":"2009","unstructured":"Nesterov, Y.: Primal-dual subgradient methods for convex problems. Math. Programm. 120(1), 221\u2013259 (2009)","journal-title":"Math. Programm."},{"issue":"1","key":"10038_CR26","first-page":"2087","volume":"15","author":"R Nishihara","year":"2014","unstructured":"Nishihara, R., Murray, I., Adams, R.P.: Parallel MCMC with generalized elliptical slice sampling. J. Mach. Learn. Res. 15(1), 2087\u20132112 (2014)","journal-title":"J. Mach. Learn. Res."},{"key":"10038_CR27","doi-asserted-by":"crossref","unstructured":"Rasmussen, C.E.: Gaussian processes in machine learning. In: Summer School on Machine Learning, Springer, pp. 63\u201371 (2003)","DOI":"10.1007\/978-3-540-28650-9_4"},{"key":"10038_CR28","doi-asserted-by":"crossref","unstructured":"Robbins, H., Monro, S.: A stochastic approximation method. Ann. Math. Stat., pp. 400\u2013407 (1951)","DOI":"10.1214\/aoms\/1177729586"},{"issue":"2","key":"10038_CR29","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1239\/jap\/1183667414","volume":"44","author":"GO Roberts","year":"2007","unstructured":"Roberts, G.O., Rosenthal, J.S.: Coupling and ergodicity of adaptive Markov chain Monte Carlo algorithms. J. Appl. Prob. 44(2), 458\u2013475 (2007)","journal-title":"J. Appl. Prob."},{"key":"10038_CR30","doi-asserted-by":"crossref","unstructured":"Sokal, A.: Monte Carlo methods in statistical mechanics: foundations and new algorithms. In: Functional Integration, Springer, pp. 131\u2013192 (1997)","DOI":"10.1007\/978-1-4899-0319-8_6"},{"issue":"3","key":"10038_CR31","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s11222-006-8769-1","volume":"16","author":"CJ Ter Braak","year":"2006","unstructured":"Ter Braak, C.J.: A Markov chain Monte Carlo version of the genetic algorithm differential evolution: easy Bayesian computing for real parameter spaces. Stat. Comput. 16(3), 239\u2013249 (2006)","journal-title":"Stat. Comput."},{"issue":"4","key":"10038_CR32","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s11222-008-9104-9","volume":"18","author":"CJ ter Braak","year":"2008","unstructured":"ter Braak, C.J., Vrugt, J.A.: Differential evolution Markov chain with snooker updater and fewer chains. Stat. Comput. 18(4), 435\u2013446 (2008)","journal-title":"Stat. Comput."},{"issue":"2","key":"10038_CR33","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1080\/10618600.2013.791193","volume":"23","author":"MM Tibbits","year":"2014","unstructured":"Tibbits, M.M., Groendyke, C., Haran, M., Liechty, J.C.: Automated factor slice sampling. J. Comput. Gr. Stat. 23(2), 543\u2013563 (2014)","journal-title":"J. Comput. Gr. Stat."},{"key":"10038_CR34","doi-asserted-by":"crossref","unstructured":"Tran, K.T., Ninness, B.: Reunderstanding slice sampling as parallel MCMC. In: 2015 IEEE Conference on Control Applications (CCA), IEEE, pp. 1197\u20131202 (2015)","DOI":"10.1109\/CCA.2015.7320775"},{"issue":"3","key":"10038_CR35","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1515\/IJNSNS.2009.10.3.273","volume":"10","author":"JA Vrugt","year":"2009","unstructured":"Vrugt, J.A., Ter Braak, C., Diks, C., Robinson, B.A., Hyman, J.M., Higdon, D.: Accelerating Markov chain Monte Carlo simulation by differential evolution with self-adaptive randomized subspace sampling. Int. J. Nonlinear Sci. Numer. Simul. 10(3), 273\u2013290 (2009)","journal-title":"Int. J. Nonlinear Sci. Numer. Simul."}],"container-title":["Statistics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-021-10038-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11222-021-10038-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-021-10038-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T14:39:06Z","timestamp":1725633546000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11222-021-10038-2"}},"subtitle":["Parallel, black-box and gradient-free inference for correlated &amp; multimodal distributions"],"short-title":[],"issued":{"date-parts":[[2021,8,15]]},"references-count":35,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["10038"],"URL":"https:\/\/doi.org\/10.1007\/s11222-021-10038-2","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"value":"0960-3174","type":"print"},{"value":"1573-1375","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,15]]},"assertion":[{"value":"16 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 July 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 August 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"61"}}