Geodesic Monte Carlo on Embedded Manifolds

  title={Geodesic Monte Carlo on Embedded Manifolds},
  author={Simon Byrne and Mark A. Girolami},
  journal={Scandinavian Journal of Statistics, Theory and Applications},
  pages={825 - 845}
  • Simon ByrneM. Girolami
  • Published 25 January 2013
  • Mathematics
  • Scandinavian Journal of Statistics, Theory and Applications
Markov chain Monte Carlo methods explicitly defined on the manifold of probability distributions have recently been established. These methods are constructed from diffusions across the manifold and the solution of the equations describing geodesic flows in the Hamilton–Jacobi representation. This paper takes the differential geometric basis of Markov chain Monte Carlo further by considering methods to simulate from probability distributions that themselves are defined on a manifold, with… 

Information-Geometric Markov Chain Monte Carlo Methods Using Diffusions

A full exposition of Markov chains and their use in Monte Carlo simulation for statistical inference and molecular dynamics is provided, with particular emphasis on methods based on Langevin diffusions.

Note on the geodesic Monte Carlo

Geodesic Monte Carlo (gMC) is a powerful algorithm for Bayesian inference on non-Euclidean manifolds. The original gMC algorithm was cleverly derived in terms of its progenitor, the Riemannian

Posterior Integration on a Riemannian Manifold

The geodesic Markov chain Monte Carlo method and its variants enable computation of integrals with respect to a posterior supported on a manifold. However, for regular integrals, the convergence rate

Hamiltonian Monte Carlo on Symmetric and Homogeneous Spaces via Symplectic Reduction

The Hamiltonian Monte Carlo method generates samples by introducing a mechanical system that explores the target density. For distributions on manifolds it is not always simple to perform the

Geodesic Lagrangian Monte Carlo over the space of positive definite matrices: with application to Bayesian spectral density estimation

ABSTRACT We present geodesic Lagrangian Monte Carlo, an extension of Hamiltonian Monte Carlo for sampling from posterior distributions defined on general Riemannian manifolds. We apply this new

Monte Carlo on Manifolds: Sampling Densities and Integrating Functions

An MCMC sampler is given for probability distributions defined by unnormalized densities on manifolds in euclidean space defined by equality and inequality constraints and used to develop a multistage algorithm to compute integrals over such manifolds.

Stochastic Gradient Geodesic MCMC Methods

We propose two stochastic gradient MCMC methods for sampling from Bayesian posterior distributions defined on Riemann manifolds with a known geodesic flow, e.g. hyperspheres. Our methods are the

Efficient Random Walks on Riemannian Manifolds

According to a version of Donsker’s theorem, geodesic random walks on Riemannian manifolds converge to the respective Brownian motion. From a computational perspective, however, evaluating geodesics

Dimension-independent Markov chain Monte Carlo on the sphere

This paper derives e-cient Markov chain Monte Carlo methods for approximate sampling of posteriors with respect to high-dimensional spheres with angular central Gaussian priors and shows dimension-independent efficiency in numerical experiments.

Bernoulli On the Geometric Ergodicity of Hamiltonian Monte

We establish general conditions under which Markov chains produced by the Hamiltonian Monte Carlo method will and will not be geometrically ergodic. We consider implementations with both



Riemann manifold Langevin and Hamiltonian Monte Carlo methods

  • M. GirolamiB. Calderhead
  • Computer Science
    Journal of the Royal Statistical Society: Series B (Statistical Methodology)
  • 2011
The methodology proposed automatically adapts to the local structure when simulating paths across this manifold, providing highly efficient convergence and exploration of the target density, and substantial improvements in the time‐normalized effective sample size are reported when compared with alternative sampling approaches.

A Family of MCMC Methods on Implicitly Defined Manifolds

A general constrained version of Hamiltonian Monte Carlo is proposed, and conditions under which the Markov chain is convergent are given, which define a family of MCMC methods which can be applied to sample from distributions on non-linear manifolds.

MCMC Using Hamiltonian Dynamics

Hamiltonian dynamics can be used to produce distant proposals for the Metropolis algorithm, thereby avoiding the slow exploration of the state space that results from the diffusive behaviour of

Markov Chain Monte Carlo Maximum Likelihood

Markov chain Monte Carlo (e. g., the Metropolis algorithm and Gibbs sampler) is a general tool for simulation of complex stochastic processes useful in many types of statistical inference. The basics

Sampling From A Manifold

We develop algorithms for sampling from a probability distribution on a submanifold embedded in R n . Applications are given to the evaluation of algorithms in 'Topological Statistics'; to goodness

Probabilistic model for two dependent circular variables

Motivated by problems in molecular biology and molecular physics, we propose a five-parameter torus analogue of the bivariate normal distribution for modelling the distribution of two circular random

A Stochastic Newton MCMC Method for Large-Scale Statistical Inverse Problems with Application to Seismic Inversion

This work addresses the solution of large-scale statistical inverse problems in the framework of Bayesian inference with a so-called Stochastic Monte Carlo method.

Geometric measure theory