{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T23:14:51Z","timestamp":1787008491653,"version":"build-2736575974"},"reference-count":29,"publisher":"Oxford University Press (OUP)","issue":"2","license":[{"start":{"date-parts":[[2022,7,8]],"date-time":"2022-07-08T00:00:00Z","timestamp":1657238400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000266","name":"U.K. Engineering and Physical Sciences Research Council","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,5,15]]},"abstract":"<jats:title>Summary<\/jats:title>\n                  <jats:p>This article introduces the hug and hop Markov chain Monte Carlo algorithm for estimating expectations with respect to an intractable distribution. The algorithm alternates between two kernels, referred to as hug and hop. Hug is a nonreversible kernel that repeatedly applies the bounce mechanism from the recently proposed bouncy particle sampler to produce a proposal point that is far from the current position yet on almost the same contour of the target density, leading to a high acceptance probability. Hug is complemented by hop, which deliberately proposes jumps between contours and has an efficiency that degrades very slowly with increasing dimension. There are many parallels between hug and Hamiltonian Monte Carlo using a leapfrog integrator, including the order of the integration scheme, but hug is also able to make use of local Hessian information without requiring implicit numerical integration steps, and its performance is not terminally affected by unbounded gradients of the log-posterior. We test hug and hop empirically on a variety of toy targets and real statistical models, and find that it can, and often does, outperform Hamiltonian Monte Carlo.<\/jats:p>","DOI":"10.1093\/biomet\/asac039","type":"journal-article","created":{"date-parts":[[2022,7,8]],"date-time":"2022-07-08T09:18:01Z","timestamp":1657271881000},"page":"301-318","source":"Crossref","is-referenced-by-count":3,"title":["Hug and hop: a discrete-time, nonreversible Markov chain Monte Carlo algorithm"],"prefix":"10.1093","volume":"110","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3832-8322","authenticated-orcid":false,"given":"M","family":"Ludkin","sequence":"first","affiliation":[{"name":"Darktrace, Maurice Wilkes Building, Cowley Road , Milton, Cambridge CB4 0DS, U.K"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2429-3157","authenticated-orcid":false,"given":"C","family":"Sherlock","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics, Lancaster University , Bailrigg, Lancaster LA1 4YF, U.K"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2022,7,8]]},"reference":[{"key":"2023051508572467600_B1","first-page":"591","article-title":"In discussion of \u2018Representations of knowledge in complex systems\u2019 by U. Grenander and M. Miller","volume":"56","author":"Besag,","year":"1994","journal-title":"J. R. Statist. Soc. B"},{"key":"2023051508572467600_B2","doi-asserted-by":"crossref","first-page":"1213","DOI":"10.1007\/s11222-015-9598-x","article-title":"Non-reversible Metropolis-Hastings","volume":"26","author":"Bierkens,","year":"2015","journal-title":"Statist. Comp."},{"key":"2023051508572467600_B3","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1080\/01621459.2017.1294075","article-title":"The bouncy particle sampler: A nonreversible rejection-free Markov chain Monte Carlo method","volume":"113","author":"Bouchard-C\u00f4t\u00e9,","year":"2018","journal-title":"J. Am. Statist. Assoc."},{"key":"2023051508572467600_B4","doi-asserted-by":"crossref","DOI":"10.1201\/b10905","volume-title":"Handbook of Markov Chain Monte Carlo.","author":"Brooks,","year":"2011"},{"key":"2023051508572467600_B5","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1214\/aoap\/1019487508","article-title":"Analysis of a nonreversible Markov chain sampler","volume":"10","author":"Diaconis,","year":"2000","journal-title":"Ann. Appl. Prob."},{"key":"2023051508572467600_B6","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1214\/18-STS648","article-title":"Piecewise deterministic Markov processes for continuous-time Monte Carlo","volume":"33","author":"Fearnhead,","year":"2018","journal-title":"Statist. Sci."},{"key":"2023051508572467600_B7","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1111\/j.1467-9868.2010.00765.x","article-title":"Riemann manifold Langevin and Hamiltonian Monte Carlo methods","volume":"73","author":"Girolami,","year":"2011","journal-title":"J. R. Statist. Soc. B"},{"key":"2023051508572467600_B8","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1093\/biomet\/57.1.97","article-title":"Monte Carlo sampling methods using Markov chains and their applications","volume":"57","author":"Hastings,","year":"1970","journal-title":"Biometrika"},{"key":"2023051508572467600_B9","first-page":"1593","article-title":"The No-U-Turn sampler: Adaptively setting path lengths in Hamiltonian Monte Carlo","volume":"15","author":"Hoffman,","year":"2014","journal-title":"J. Mach. Learn. Res."},{"key":"2023051508572467600_B10","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.jeconom.2009.01.009","article-title":"Parametric links for binary choice models: A Fisherian\u2013Bayesian colloquy","volume":"152","author":"Koenker,","year":"2009","journal-title":"J. Economet."},{"key":"2023051508572467600_B11","article-title":"Simulating Hamiltonian Dynamics","volume-title":"Cambridge Monographs on Applied and Computational Mathematics.","author":"Leimkuhler,","year":"2004"},{"key":"2023051508572467600_B12","doi-asserted-by":"crossref","first-page":"3109","DOI":"10.3150\/18-BEJ1083","article-title":"On the geometric ergodicity of Hamiltonian Monte Carlo","volume":"25","author":"Livingstone,","year":"2019","journal-title":"Bernoulli"},{"key":"2023051508572467600_B13","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s11222-018-9802-x","article-title":"Irreversible samplers from jump and continuous Markov processes","volume":"29","author":"Ma,","year":"2018","journal-title":"Statist. Comp."},{"key":"2023051508572467600_B14","article-title":"Directional Metropolis-Hastings","author":"Mallik,","year":"2017","journal-title":"arXiv: 1710.09759"},{"key":"2023051508572467600_B15","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1214\/aos\/1033066201","article-title":"Rates of convergence of the Hastings and Metropolis algorithms","volume":"24","author":"Mengersen,","year":"1996","journal-title":"Ann. Statist."},{"key":"2023051508572467600_B16","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/978-94-011-5014-9_8","article-title":"Suppressing random walks in Markov chain Monte Carlo using ordered overrelaxation","volume-title":"Learning in Graphical Models","author":"Neal,","year":"1998"},{"key":"2023051508572467600_B17","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1201\/b10905-6","article-title":"MCMC using Hamiltonian dynamics","volume-title":"Handbook of Markov Chain Monte Carlo","author":"Neal,","year":"2011"},{"key":"2023051508572467600_B18","first-page":"2741","article-title":"Stochastic bouncy particle sampler","volume":"70","author":"Pakman,","year":"2017","journal-title":"Proc. Mach. Learn. Res."},{"key":"2023051508572467600_B19","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.85.026703","article-title":"Rejection-free Monte Carlo sampling for general potentials","volume":"85","author":"Peters,","year":"2012","journal-title":"Phys. Rev. E"},{"key":"2023051508572467600_B20","volume-title":"Probabilistic Models for Some Intelligence and Attainment Tests","author":"Rasch,","year":"1980"},{"key":"2023051508572467600_B21","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1111\/1467-9868.00123","article-title":"Optimal scaling of discrete approximations to Langevin diffusions","volume":"60","author":"Roberts,","year":"1998","journal-title":"J. R. Statist. Soc. B"},{"key":"2023051508572467600_B22","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1214\/ss\/1015346320","article-title":"Optimal scaling for various Metropolis-Hastings algorithms","volume":"16","author":"Roberts,","year":"2001","journal-title":"Statist. Sci."},{"key":"2023051508572467600_B23","doi-asserted-by":"crossref","first-page":"341","DOI":"10.2307\/3318418","article-title":"Exponential convergence of Langevin distributions and their discrete approximations","volume":"2","author":"Roberts,","year":"1996","journal-title":"Bernoulli"},{"key":"2023051508572467600_B24","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1093\/biomet\/83.1.95","article-title":"Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms","volume":"83","author":"Roberts,","year":"1996","journal-title":"Biometrika"},{"key":"2023051508572467600_B25","first-page":"1665","article-title":"Kernel adaptive Metropolis-Hastings","author":"Sejdinovic,","year":"2014","journal-title":"Proc. 31st Int. Conf. Machine Learning (ICML\u201914). JMLR"},{"key":"2023051508572467600_B26","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1214\/10-STS327","article-title":"The random walk Metropolis: Linking theory and practice through a case study","volume":"25","author":"Sherlock,","year":"2010","journal-title":"Statist. Sci."},{"key":"2023051508572467600_B27","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1093\/biomet\/asab013","article-title":"A discrete bouncy particle sampler","volume":"109","author":"Sherlock,","year":"2022","journal-title":"Biometrika"},{"key":"2023051508572467600_B28","article-title":"Piecewise deterministic Markov chain Monte Carlo","author":"Vanetti,","year":"2018","journal-title":"arXiv: 1707.05296v2"},{"key":"2023051508572467600_B29","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1007\/s11222-019-09913-w","article-title":"The coordinate sampler: A non-reversible Gibbs-like MCMC sampler","volume":"30","author":"Wu,","year":"2020","journal-title":"Statist. Comp."}],"container-title":["Biometrika"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/biomet\/advance-article-pdf\/doi\/10.1093\/biomet\/asac039\/46352277\/asac039.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/biomet\/article-pdf\/110\/2\/301\/50311360\/asac039.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/biomet\/article-pdf\/110\/2\/301\/50311360\/asac039.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T04:58:07Z","timestamp":1684126687000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/biomet\/article\/110\/2\/301\/6633932"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,8]]},"references-count":29,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2022,7,8]]},"published-print":{"date-parts":[[2023,5,15]]}},"URL":"https:\/\/doi.org\/10.1093\/biomet\/asac039","relation":{},"ISSN":["0006-3444","1464-3510"],"issn-type":[{"value":"0006-3444","type":"print"},{"value":"1464-3510","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2023,6,1]]},"published":{"date-parts":[[2022,7,8]]}}}