mlsanityData to 14 Oct 2026

Verlet Flows: Exact-Likelihood Integrators for Flow-Based Generative Models

arXiv 2405.02805 ↗First posted 5 May 2024cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

Approximations in computing model likelihoods with continuous normalizing flows (CNFs) hinder the use of these models for importance sampling of Boltzmann distributions, where exact likelihoods are required. In this work, we present Verlet flows, a class of CNFs on an augmented state-space inspired by symplectic integrators from Hamiltonian dynamics. When used with carefully constructed Taylor-Verlet integrators, Verlet flows provide exact-likelihood generative models which generalize coupled flow architectures from a non-continuous setting while imposing minimal expressivity constraints. On experiments over toy densities, we demonstrate that the variance of the commonly used Hutchinson trace estimator is unsuitable for importance sampling, whereas Verlet flows perform comparably to full autograd trace computations while being significantly faster.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 10 of its 12 references that are in the map. First posted on arXiv 5 May 2024.

Builds on

10 of 12 references.

References · 10

  1. 2018Neural Ordinary Differential Equationscited by 3,779
  2. 2016Density estimation using Real NVPcited by 2,042
  3. 2014NICE: Non-linear Independent Components Estimationcited by 1,058
  4. 2017Masked Autoregressive Flow for Density Estimationcited by 684
  5. 2016Improving Variational Inference with Inverse Autoregressive Flowcited by 640
  6. 2019Neural Spline Flowscited by 596
  7. 2018FFJORD: Free-form Continuous Dynamics for Scalable Reversible Generative Modelscited by 594
  8. 2018Neural Importance Samplingcited by 155
  9. 2023SE(3) Equivariant Augmented Coupling Flowscited by 37
  10. 2024Scalable Normalizing Flows Enable Boltzmann Generators for Macromoleculescited by 10

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 0; 2026: 1.

2 papers.