Nested Sampling with Constrained Hamiltonian Monte Carlo

Preprint English OPEN
Betancourt, M. J. (2010)

Nested sampling is a powerful approach to Bayesian inference ultimately limited by the computationally demanding task of sampling from a heavily constrained probability distribution. An effective algorithm in its own right, Hamiltonian Monte Carlo is readily adapted to efficiently sample from any smooth, constrained distribution. Utilizing this constrained Hamiltonian Monte Carlo, I introduce a general implementation of the nested sampling algorithm.
  • References (8)

    [1] MacKay, D. J. C. (2003) Information Theory, Inference, and Learning Algorithms. Cambridge University Press, New York

    [2] Jaynes, E. T. (2003) Probability Theory: The Logic of Science, Cambridge University Press, New York

    [3] Skilling, J. (2004) Nested Sampling. In Maximum Entropy and Bayesian methods in science and engineering (ed. G. Erickson, J. T. Rychert, C. R. Smith). AIP Conf. Proc., 735: 395-405.

    [4] Sivia, D. S. with Skilling, J. (2006) Data Analysis. Oxford, New York

    [5] Feroz, F., Hobson, M. P, Bridges, M. arXiv:0809.3437v1

    [6] Brewer, B. J., Partay, L. B., and Csanyi, G. arXiv:0912.2380v1

    [7] Bishop, C.M. (2007) Pattern Classification and Machine Learning. Springer, New York

    [8] Neal, R. M. MCMC using Hamiltonian, 2010. dynamics, March 5,

  • Metrics
    views in OpenAIRE
    views in local repository
    downloads in local repository
Share - Bookmark