%0 Generic %1 sanzserna2020algorithm %A Sanz-Serna, J. M. %D 2020 %K lattice %T Is the NUTS algorithm correct? %U http://arxiv.org/abs/2005.01336 %X This paper is devoted to investigate whether the popular No U-turn (NUTS) sampling algorithm is correct, i.e.\ whether the target probability distribution is exactly conserved by the algorithm. It turns out that one of the Gibbs substeps used in the algorithm cannot always be guaranteed to be correct.

@misc{sanzserna2020algorithm, abstract = {This paper is devoted to investigate whether the popular No U-turn (NUTS) sampling algorithm is correct, i.e.\ whether the target probability distribution is \emph{exactly} conserved by the algorithm. It turns out that one of the Gibbs substeps used in the algorithm cannot always be guaranteed to be correct.}, added-at = {2021-03-26T16:30:32.000+0100}, author = {Sanz-Serna, J. M.}, biburl = {https://www.bibsonomy.org/bibtex/22ddaff2427b3b045f78375137910ee31/cmcneile}, description = {Is the NUTS algorithm correct?}, interhash = {71dea7dee59cae552506ce5fe16339c1}, intrahash = {2ddaff2427b3b045f78375137910ee31}, keywords = {lattice}, note = {cite arxiv:2005.01336Comment: Some statements in the paper are misleading. It is possible to think of NUTS at not being a slice/Gibbs sampler and, with an alternative interpretation, it may be be possible to prove that the algorithm is correct. In addition the experiment reported in Figure 2 should have had many initial states drawn from the target rather than using a single value}, timestamp = {2021-03-26T16:30:32.000+0100}, title = {Is the NUTS algorithm correct?}, url = {http://arxiv.org/abs/2005.01336}, year = 2020 }