REVIEW 6 cited by
Dynamical Measure Transport and Neural PDE Solvers for Sampling
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Dynamical Measure Transport and Neural PDE Solvers for Sampling
read the original abstract
The task of sampling from a probability density can be approached as transporting a tractable density function to the target, known as dynamical measure transport. In this work, we tackle it through a principled unified framework using deterministic or stochastic evolutions described by partial differential equations (PDEs). This framework incorporates prior trajectory-based sampling methods, such as diffusion models or Schr\"odinger bridges, without relying on the concept of time-reversals. Moreover, it allows us to propose novel numerical methods for solving the transport task and thus sampling from complicated targets without the need for the normalization constant or data samples. We employ physics-informed neural networks (PINNs) to approximate the respective PDE solutions, implying both conceptional and computational advantages. In particular, PINNs allow for simulation- and discretization-free optimization and can be trained very efficiently, leading to significantly better mode coverage in the sampling task compared to alternative methods. Moreover, they can readily be fine-tuned with Gauss-Newton methods to achieve high accuracy in sampling.
Forward citations
Cited by 6 Pith papers
-
Complexity Analysis of Normalizing Constant Estimation: from Jarzynski Equality to Annealed Importance Sampling and beyond
Derives Õ(d β² A² / ε⁴) oracle complexity for AIS estimating normalizing constant Z to relative error ε and introduces reverse diffusion sampler for geometric paths with large action.
-
Markov Chain Monte Carlo with Diffusion Paths
MAD-Path uses forward–backward diffusion paths as Metropolis proposals so multimodal targets stay invariant and mode weights are preserved better than under tempering.
-
Tensor Train Diffusion: Leveraging Low-Rank Structures for High-Dimensional Score-Based Sampling
Functional tensor trains plus BSDE regression solve the HJB score PDE, yielding a fast low-rank sampler that outperforms neural diffusion methods on multimodal targets.
-
FES-FM: Free Energy Surface Sampling via Reduced Flow Matching
FES-FM applies reduced flow matching with a Hessian-derived prior to directly sample free energy surfaces in collective variable space, claiming lower computational cost and higher accuracy per unit time than standard...
-
Diffusion-based Annealed Boltzmann Generators : benefits, pitfalls and hopes
Even a perfect diffusion model yields poor annealed Boltzmann generators when coupled through first-order stochastic denoising kernels, while deterministic transport maps and second-order kernels improve; with learned...
-
FES-FM: Free Energy Surface Sampling via Reduced Flow Matching
FES-FM learns a reduced flow-matching transport in collective-variable space to sample free energy surfaces, cutting per-sample generation cost while leaving full-space training cost unchanged.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.