Hamiltonian Monte Carlo (HMC) is one of the most popular MCMC inference methods. The No-U-Turn Sampler (NUTS), an adaptive extension of HMC, eliminates the need to tune trajectory lengths, to which HMC is sensitive. Generalizing HMC, the Nonparametric HMC (NP-HMC) algorithm can be applied to models with a parameter space of varying dimension.
We introduce NP-NUTS, a hybrid of NUTS and NP-HMC. This new algorithm automatically adjusts trajectory lengths and gives a dynamically tuned version of NP-HMC. We address the main challenges in devising NP-NUTS: ensuring correct and efficient sampling from the constructed tree, and adjusting the stopping conditions to preserve detailed balance.
Extended abstract (NP_NUTS.pdf) | 500KiB |
Sun 19 JanDisplayed time zone: Mountain Time (US & Canada) change
Sun 19 Jan
Displayed time zone: Mountain Time (US & Canada) change
14:00 - 15:30 | |||
14:00 40mTalk | Invited talk: Modern Bayesian Experimental Design LAFI Desi R. Ivavona University of Oxford | ||
14:41 15mTalk | Semantics of the memo Probabilistic Programming Language LAFI | ||
14:57 15mTalk | NP-NUTS: A Nonparametric No-U-Turn Sampler LAFI Maria-Nicoleta Craciun University of Oxford, C.-H. Luke Ong NTU, Sam Staton University of Oxford, Matthijs Vákár Utrecht University File Attached | ||
15:13 15mTalk | Sandwood: Runtime Adaptable Probabilistic Programming for Java (Remote) LAFI File Attached |