Differentiating Metropolis-Hastings to Optimize Intractable Densities
Other conference contribution, 2023

We develop an algorithm for automatic differentiation of Metropolis-Hastings samplers, allowing us to differentiate through probabilistic inference, even if the model has discrete components within it. Our approach fuses recent advances in stochastic automatic differentiation with traditional Markov chain coupling schemes, providing an unbiased and low-variance gradient estimator. This allows us to apply gradient-based optimization to objectives expressed as expectations over intractable target densities. We demonstrate our approach by finding an ambiguous observation in a Gaussian mixture model and by maximizing the specific heat in an Ising model.

automatic differentiation

Markov chain coupling

Metropolis-Hastings

Author

Gaurav Arya

Ruben Seyer

Chalmers, Mathematical Sciences, Applied Mathematics and Statistics

Frank Schäfer

Kartik Chandra

Alexander Lew

Mathieu Huot

Vikash Mansinghka

Jonathan Ragan-Kelley

Christopher Vincent Rackauckas

Moritz Schauer

Chalmers, Mathematical Sciences, Applied Mathematics and Statistics

Differentiable Almost Everything Workshop of the 40th International Conference on Machine Learning
Honolulu, Hawaii, USA,

Subject Categories

Computational Mathematics

Probability Theory and Statistics

Roots

Basic sciences

More information

Created

4/3/2024 5