Skip to content
Preprint

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

Aug 2026 · 1 citation
Mathematics Computer Science

TL;DR

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.

Abstract

Diffusion models learn to reverse a predefined corruption process, but sampling still requires a costly time discretization and depends on the chosen noise schedule. We study these two issues for variance-preserving diffusions with matrix-valued schedules. Our analysis transfers reverse-time discretization errors to the forward corruption law and treats two numerical schemes within a common framework. The first freezes the score and yields, through a matrix-sensitive local comparison and forward information dissipation, an ambient-dimensional step complexity with leading factor $d/\varepsilon^2$ for KL accuracy $\varepsilon^2$. The second keeps the known Gaussian drift exact and freezes the posterior mean. For data of metric-entropy dimension $k$, a forward Markov identity, an anisotropic covering estimate, and Stieltjes integration by parts give the corresponding factor $k\log k/\varepsilon^2$. In both cases, the proof identifies a local error, accumulates it through the forward evolution, and inserts the result into a common KL decomposition. The local errors further provide directional criteria for matrix schedules and an asymptotically optimal square-root adaptive grid. A high-dimensional Gaussian-mixture experiment illustrates the resulting schedule and grid improvements.

View source

Similar papers

Preprint Aug 2026

Posterior Information Dynamics of Diffusion Models for Linear Inverse Problems

Diffusion models are widely used as priors for linear inverse problems, yet endpoint quality does not reveal when measurement information enters reverse denoising or how it is allocated across signal directions. We study this process through the smoothed likelihood force, the difference between exact posterior and prio...

Xiangming Meng · 1 citation
Preprint Aug 2026

Diffusion Quasi-Monte Carlo

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.

Jian-Long Chen, Yi-Feng Yu · 0 citations
Preprint Aug 2026

Provably adaptive sampling with uniform and remasking discrete diffusion models

This work considers a first-order sampler based on the leave-one-out denoiser for uniform and remasking processes whose coordinate updates can be performed in parallel, and derives an exact information-theoretic representation of the discretization error in terms of the mutual information between different coordinates...

Daniil Dmitriev, Zhi-Han Huang, Yuting Wei · 1 citation
Jul 2026

Denoising growth complexity: Data geometry and certified schedules for diffusion sampling

It is shown how the $\mathsf{DGC}$ increments lead to a simple and explicit bound on the KL error of an Euler scheme applied to the stochastic innovations representation, thereby recovering and sharpening a range of existing diffusion-sampling guarantees, as well as giving new results.

Martin J. Wainwright · 1 citation
Preprint Sep 2026

Sharp propagation of chaos for mean-field backward stochastic differential equations

We study propagation of chaos for decoupled mean-field forward-backward stochastic differential equations whose generators depend on the empirical laws of the forward states, backward values and diagonal martingale integrands. Under monotonicity and Lipschitz assumptions, synchronous coupling gives quantitative estimat...

Shu-Xian Gao, Ying Hu, Jia-Qiang Wen · 0 citations

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