Skip to content
Preprint

Diffusion Quasi-Monte Carlo

Aug 2026 · 0 citations · 13 references
Mathematics Computer Science

TL;DR

This work constructs a cube-to-target map by composing a Gaussian base transformation (the component-wise inverse Gaussian CDF) with an Euler-discretized probability flow ODE, and establishes conditions for diffusion probability-flow transport under mild bounded-derivative assumptions on the learned vector field.

Abstract

We study high-dimensional numerical integration with respect to complex target measures using diffusion-based transport maps and randomized quasi-Monte Carlo (RQMC). Score-based diffusion models induce a deterministic probability flow ODE that transports a simple prior to the target, suggesting a principled way to transform low-discrepancy points on the unit cube into informative samples. We construct a cube-to-target map by composing a Gaussian base transformation (the component-wise inverse Gaussian CDF) with an Euler-discretized probability flow ODE. To retain unbiasedness under transport approximation, we formulate integration as importance sampling (IS) on the cube. Our main result provides verifiable conditions under which the resulting IS integrand satisfies the boundary growth condition, implying an $O(N^{-1+\epsilon})$ RMSE for scrambled nets. We then establish these conditions for diffusion probability-flow transport under mild bounded-derivative assumptions on the learned vector field, explicitly controlling the boundary singularities introduced by the inverse Gaussian CDF. Experiments range from a 2D mixture to 784D images and a 40,960D conditional vorticity-assimilation task; in the latter, blocked scrambled Sobol'sampling reduces the randomization standard deviation of nonlinear accuracy metrics at essentially unchanged online denoising cost. Together, these results give a theoretical and empirical foundation for combining diffusion generative modeling with high-precision RQMC integration.

View source

Similar papers

Preprint Aug 2026

Forward-Evolution Error Analysis and Adaptive Design for Matrix-Valued Diffusion Models

This analysis transfers reverse-time discretization errors to the forward corruption law and treats two numerical schemes within a common framework, which identifies a local error, accumulates it through the forward evolution, and inserts the result into a common KL decomposition.

T. Pang, Zuowei Shen, Rui-Tong Zhang · 1 citation
Preprint Aug 2026

Ordered Diffusion Kernels

We introduce Ordered Diffusion Kernels (ODKs), a novel class of local kernels that can approximate the infinitesimal generator of an arbitrary It\^o Stochastic Differential Equation (SDE). ODKs are designed to be applied to data sampled from dynamical systems where little dynamical information is available a priori. Th...

Jack H. Soulsby, A. C. S. Jørgensen, Atiyo Ghosh et al. · 0 citations
Preprint Jul 2026

Mimicking diffusion processes with differential equations

The probability-flow ordinary differential equation (PF-ODE) associated with a diffusion process is widely used in score-based generative modeling as a deterministic sampler that reproduces the marginal distributions of the diffusion. The validity of this marginal-matching property depends on the well-posedness of an o...

R. Cont · 1 citation
Preprint Aug 2026

Weighted Laplacian Flow: A Deterministic Particle Flow with Exponential Convergence

We introduce weighted Laplacian flow (WLF), a deterministic particle-flow framework for sampling from a target distribution known only up to normalization. The proposed method evolves the logarithmic density ratio through a transport equation and determines the particle velocity from a target-weighted Poisson problem,...

Wei-Ye Gan, Tang-Jun Wang, Zuo-Qiang Shi · 0 citations
#diffusion models Open access Sep 2026

Mean-field path-integral diffusion from samples to interacting agents

Moving probability distributions in the context of stochastic processes efficiently is central to modern generative modeling, uncertainty quantification, and control of large engineered systems. Most current methods generate temporal trajectories independently, leaving open whether the trajectories can cooperate throug...

M. Chertkov · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.