Papers › The No-U-Turn Sampler: Adaptively Setting Path Lengths in Hamiltonian Monte Carlo

The No-U-Turn Sampler: Adaptively Setting Path Lengths in Hamiltonian Monte Carlo

18 Nov 2011arXiv:1111.4246archive 2025-07-28

Matthew D. Hoffman, Andrew Gelman

Hamiltonian Monte Carlo (HMC) is a Markov chain Monte Carlo (MCMC) algorithm that avoids the random walk behavior and sensitivity to correlated parameters that plague many MCMC methods by taking a series of steps informed by first-order gradient information. These features allow it to converge to high-dimensional target distributions much more quickly than simpler methods such as random walk Metropolis or Gibbs sampling. However, HMC's performance is highly sensitive to two user-specified parameters: a step size ε and a desired number of steps L. In particular, if L is too small then the algorithm exhibits undesirable random walk behavior, while if L is too large the algorithm wastes computation. We introduce the No-U-Turn Sampler (NUTS), an extension to HMC that eliminates the need to set a number of steps L. NUTS uses a recursive algorithm to build a set of likely candidate points that spans a wide swath of the target distribution, stopping automatically when it starts to double back and retrace its steps. Empirically, NUTS perform at least as efficiently as and sometimes more efficiently than a well tuned standard HMC method, without requiring user intervention or costly tuning runs. We also derive a method for adapting the step size parameter ε on the fly based on primal-dual averaging. NUTS can thus be used with no hand-tuning at all. NUTS is also suitable for applications such as BUGS-style automatic inference engines that require efficient "turnkey" sampling algorithms.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 9 code samples harvested from 2 repositories linked to this paper: 6 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified. Where Syntology's instrument failed: 2 where our contract draft was wrong; 2 where the contract check could not run; failures of Syntology's instrument, not of the code.

By repository: community (archive-listed): 9 samples from 2 repositories, 6 ran (2 with no instrument failure; 4 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

No sample is linked to this paper from 2 of its repositories that Syntology harvested for other papers:

Levels written on 2026-09-22 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

4ment/phylostan mentioned on GitHubGPL-3.0Syntology: not harvested report
ColCarroll/minimc mentioned on GitHubMITSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Faster Hamiltonian Monte Carlo by Learning Leapfrog Scale (arXiv:1810.04449; that paper's own run record: 9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified); nothing checks that they implement this paper's method. report
JohannesBuchner/PinNUTS mentioned on GitHubSyntology: 3 samples, 0 ran · 3 unverified report
Matematija/continuous-vmc mentioned on GitHubjaxApache-2.0Syntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to A Conceptual Introduction to Hamiltonian Monte Carlo (arXiv:1701.02434; that paper's own run record: 3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified); nothing checks that they implement this paper's method. report
al-jshen/d2b mentioned on GitHubMITSyntology: not harvested report
al-jshen/gmestan-examples mentioned on GitHubMITSyntology: not harvested report
lukuiR/Stan mentioned on GitHubSyntology: not harvested report
mfouesneau/NUTS mentioned on GitHubSyntology: 6 samples, 6 ran (4 instrument-failed) · 0 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

9 samples harvested: 6 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · honoured contract
1ran · violated contract
2ran · our draft was wrong
2ran; the contract check could not run
3unverified

Licence: 0 of the 9 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

JohannesBuchner/PinNUTS community (archive-listed) 3 samples, 0 ran · 3 unverified
build_tree in 14 papers pinnuts/pinnuts.py unverified MIT (permissive) · 4d864798cca4b23b · report
pinnuts pinnuts/pinnuts.py unverified MIT (permissive) · 4f8a7d049558a7a8 · report
tree_sample pinnuts/pinnuts.py unverified MIT (permissive) · 86a695959d00fddb · report
mfouesneau/NUTS community (archive-listed) 6 samples, 6 ran (4 instrument-failed) · 0 unverified
find_reasonable_epsilon nuts/nuts.py ran · our draft was wrong MIT (permissive) · 20075d35f2319a01 · report fixture: signature theta0:ndarray/1/float, grad0:ndarray/1/float, logp0:float/0/float, f:callable/0/? · returned float · level recorded 2026-09-22
grad_logLikelihood examples/imf_examples.py ran; the contract check could not run (RAISES) · metamorphic tier: invariant fingerprinted MIT (permissive) · 537a746770a10e4a · report fixture: signature theta:ndarray/1/float, D:float/0/float, N:int/0/int, M_min:float/0/float, M_max:float/0/float · returned ndarray · level recorded 2026-09-22
leapfrog in 10 papers nuts/nuts.py ran · our draft was wrong MIT (permissive) · 7475a1db9181c908 · report fixture: signature theta:ndarray/1/float, r:ndarray/1/float, grad:ndarray/1/float, epsilon:float/0/float, f:callable/0/? · returned tuple · level recorded 2026-09-22
logLikelihood examples/imf_examples.py ran; the contract check could not run (RAISES) · metamorphic tier: invariant fingerprinted MIT (permissive) · 18842e42f9d6dd71 · report fixture: signature theta:ndarray/1/float, D:float/0/float, N:int/0/int, M_min:float/0/float, M_max:float/0/float · returned float64 · level recorded 2026-09-22
random_PowerLaw examples/imf_examples.py ran · honoured contract fingerprinted MIT (permissive) · cb1a1453761fca1d · report fixture: signature N:int/0/int, alpha:float/0/float, M_min:float/0/float, M_max:float/0/float · returned ndarray · level recorded 2026-09-22
stop_criterion nuts/nuts.py ran · violated contract fingerprinted MIT (permissive) · e6fec7e2a2392138 · report fixture: signature thetaminus:ndarray/1/float, thetaplus:ndarray/1/float, rminus:ndarray/1/float, rplus:ndarray/1/float · returned bool · level recorded 2026-09-22

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections