Search Results for author: Michael Betancourt

Found 9 papers, 6 papers with code

A Unifying and Canonical Description of Measure-Preserving Diffusions

no code implementations6 May 2021 Alessandro Barp, So Takao, Michael Betancourt, Alexis Arnaudon, Mark Girolami

A complete recipe of measure-preserving diffusions in Euclidean space was recently derived unifying several MCMC algorithms into a single framework.

Bregman dynamics, contact transformations and convex optimization

2 code implementations6 Dec 2019 Alessandro Bravetti, Maria L. Daza-Torres, Hugo Flores-Arguedas, Michael Betancourt

Recent research on accelerated gradient methods of use in optimization has demonstrated that these methods can be derived as discretizations of dynamical systems.

Visualization in Bayesian workflow

2 code implementations5 Sep 2017 Jonah Gabry, Daniel Simpson, Aki Vehtari, Michael Betancourt, Andrew Gelman

Bayesian data analysis is about more than just computing a posterior distribution, and Bayesian visualization is about more than trace plots of Markov chains.

Methodology Applications

A Conceptual Introduction to Hamiltonian Monte Carlo

9 code implementations10 Jan 2017 Michael Betancourt

Hamiltonian Monte Carlo has proven a remarkable empirical success, but only recently have we begun to develop a rigorous under- standing of why it performs so well on difficult problems and how it is best applied in practice.

Methodology

Diagnosing Suboptimal Cotangent Disintegrations in Hamiltonian Monte Carlo

3 code implementations3 Apr 2016 Michael Betancourt

When properly tuned, Hamiltonian Monte Carlo scales to some of the most challenging high-dimensional problems at the frontiers of applied statistics, but when that tuning is suboptimal the performance leaves much to be desired.

Methodology

On the Geometric Ergodicity of Hamiltonian Monte Carlo

no code implementations29 Jan 2016 Samuel Livingstone, Michael Betancourt, Simon Byrne, Mark Girolami

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

Position

Identifying the Optimal Integration Time in Hamiltonian Monte Carlo

no code implementations2 Jan 2016 Michael Betancourt

By leveraging the natural geometry of a smooth probabilistic system, Hamiltonian Monte Carlo yields computationally efficient Markov Chain Monte Carlo estimation.

Methodology Computation

The Stan Math Library: Reverse-Mode Automatic Differentiation in C++

1 code implementation23 Sep 2015 Bob Carpenter, Matthew D. Hoffman, Marcus Brubaker, Daniel Lee, Peter Li, Michael Betancourt

As computational challenges in optimization and statistical inference grow ever harder, algorithms that utilize derivatives are becoming increasingly more important.

Mathematical Software G.1.0; G.1.3; G.1.4; F.2.1

Cannot find the paper you are looking for? You can Submit a new open access paper.