Learning Optimal Flows for Non-Equilibrium Importance Sampling
Not on the map. Why?
Abstract (arXiv)
Many applications in computational sciences and statistical inference require the computation of expectations with respect to complex high-dimensional distributions with unknown normalization constants, as well as the estimation of these constants. Here we develop a method to perform these calculations based on generating samples from a simple base distribution, transporting them by the flow generated by a velocity field, and performing averages along these flowlines. This non-equilibrium importance sampling (NEIS) strategy is straightforward to implement and can be used for calculations with arbitrary target distributions. On the theory side, we discuss how to tailor the velocity field to the target and establish general conditions under which the proposed estimator is a perfect estimator with zero-variance. We also draw connections between NEIS and approaches based on mapping a base distribution onto a target via a transport map. On the computational side, we show how to use deep learning to represent the velocity field by a neural network and train it towards the zero variance optimum. These results are illustrated numerically on benchmark examples (with dimension up to 10), where after training the velocity field, the variance of the NEIS estimator is reduced by up to 6 orders of magnitude than that of a vanilla estimator. We also compare the performances of NEIS with those of Neal's annealed importance sampling (AIS).
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 9 of its 45 references that are in the map. First posted on arXiv 20 Jun 2022.
Builds on
9 of 45 references.
References · 9
- 2018Neural Ordinary Differential Equationscited by 3,779
- 2015Variational Inference with Normalizing Flowscited by 2,170
- 2019Normalizing Flows for Probabilistic Modeling and Inferencecited by 1,323
- 2020Stochastic Normalizing Flowscited by 157
- 2018Neural Importance Samplingcited by 155
- 2019Painless Stochastic Gradient: Interpolation, Line-Search, and Convergence Ratescited by 119
- 2021Annealed Flow Transport Monte Carlocited by 90
- 2020Targeted free energy estimation via learned mappingscited by 67
- 2013A Dacorogna-Moser approach to flow decomposition and minimal flow problemscited by 1
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 1; 2025: 0; 2026: 2.
4 papers.
- 2026FluxLite: Inference-Time Proposal Control for Discrete Diffusion Models28 Sep 2026
- 2026Beckmann Transport Models: From Autonomous Flows to One-Step Maps3 Aug 2026
- 2024Ensemble-Based Annealed Importance Sampling28 Jan 2024
- 2022A Mathematical Framework for Learning Probability Distributions22 Dec 2022