mlsanityData to 14 Oct 2026

Differentiating Metropolis-Hastings to Optimize Intractable Densities

arXiv 2306.07961 ↗First posted 13 Jun 2023stat.ML cs.LG stat.COcited by 6

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 10 of its 24 references that are in the map. First posted on arXiv 13 Jun 2023.

Builds on

10 of 24 references.

References · 10

  1. 2020Improved Contrastive Divergence Training of Energy Based Modelscited by 130
  2. 2022Score-Based Diffusion meets Annealed Importance Samplingcited by 51
  3. 2021Monte Carlo Variational Auto-Encoderscited by 36
  4. 2021Differentiable Annealed Importance Sampling and the Perils of Gradient Noisecited by 36
  5. 2022Automatic Differentiation of Programs with Discrete Randomnesscited by 29
  6. 2022Designing Perceptual Puzzles by Differentiating Probabilistic Programscited by 12
  7. 2022ADEV: Sound Automatic Differentiation of Expected Values of Probabilistic Programscited by 12
  8. 2021Storchastic: A Framework for General Stochastic Automatic Differentiationcited by 11
  9. 2020Maximal couplings of the Metropolis-Hastings algorithmcited by 7
  10. 2023Acting as Inverse Inverse Planningcited by 5

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 2; 2024: 0; 2025: 0; 2026: 4.

6 papers.