Stochastic automatic differentiation for Monte Carlo processes
Not on the map. Why?
Abstract (arXiv)
Monte Carlo methods represent a cornerstone of computer science. They allow to sample high dimensional distribution functions in an efficient way. In this paper we consider the extension of Automatic Differentiation (AD) techniques to Monte Carlo process, addressing the problem of obtaining derivatives (and in general, the Taylor series) of expectation values. Borrowing ideas from the lattice field theory community, we examine two approaches. One is based on reweighting while the other represents an extension of the Hamiltonian approach typically used by the Hybrid Monte Carlo (HMC) and similar algorithms. We show that the Hamiltonian approach can be understood as a change of variables of the reweighting approach, resulting in much reduced variances of the coefficients of the Taylor series. This work opens the door to find other variance reduction techniques for derivatives of expectation values.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 6 of its 24 references that are in the map. First posted on arXiv 28 Jul 2023.
Builds on
6 of 24 references.
References · 6
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2021Priors in Bayesian Deep Learning: A Reviewcited by 101
- 2018Implicit Reparameterization Gradientscited by 85
- 2021Variational Refinement for Importance Sampling Using the Forward Kullback-Leibler Divergencecited by 29
- 2020Optimal Variance Control of the Score Function Gradient Estimator for Importance Weighted Boundscited by 7
- 2019GO Gradient for Expectation-Based Objectivescited by 5
Built on by
Not cited yet.