paper-with-me

홈 › Papers

Geometry-Aware Discretization Error of Diffusion Models

2026-05-08 · Samuel Hurault, Thomas Moreau, Gabriel Peyré arxiv

Practical diffusion sampling is a numerical approximation problem: under a fixed inference budget, one must simulate a reverse-time ODE or SDE using only a limited number of denoising steps, so discretization error is often the dominant source of error. Existing non-asymptotic analyses provide convergence guarantees, but are typically too loose and too insensitive to diffusion parameters to guide practical design: broad families of schedules receive the same rates, which depend on coarse worst-case quantities such as the dimension or the drift Lipschitz constant. We take a less ambitious but more informative route. In the exact-score setting, we derive first-order asymptotic expansions of the Euler-Maruyama weak and Fréchet discretization errors. These formulas hold for general smooth reverse diffusions and become fully explicit under Gaussian data. They show how discretization error adapts to the geometry of the data through the covariance spectrum, and how this geometry interacts with key diffusion parameters, including the diffusion schedules and the diffusion-term coefficient. This yields tractable objectives for geometry-aware parameter optimization. Finally, we show that the qualitative predictions of the Gaussian formulas remain robust across diffusion sampling problems with different geometries, including image generation on different datasets and image posterior sampling.

📄 PDF Abstract BibTeX arXiv:2605.08392

Code (0)

등록된 구현이 없습니다.

Tasks

Image Generation

Similar Papers 제목 키워드 기반

Geometry-Aware Optimal Transport: Fast Intrinsic Dimension and Wasserstein Distance Estimation

2026-02-04 · Ferdinand Genans, Olivier Wintenberger arxiv

Solving large scale Optimal Transport (OT) in machine learning typically relies on sampling measures to obtain a tractable discrete problem. While the discrete solver's accuracy is controllable, the rate of convergence o…

Computational Efficiency

The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity

2026-08-13 · Martin J. Wainwright arxiv

We study masking diffusion for discrete sampling and introduce a path-resolved measure of data geometry called the \emph{unmasking growth complexity} ({\textsf{UGC}\xspace}). Its local increments directly control Kullbac…

A Simple Analysis of Discretization Error in Diffusion Models

2025-06-10 · Juhyeok Choi, Chenglin Fan

Diffusion models, formulated as discretizations of stochastic differential equations (SDEs), achieve state-of-the-art generative performance. However, existing analyses of their discretization error often rely on complex…

Denoising

Higher Order Generalization Error for First Order Discretization of Langevin Diffusion

2021-02-11 · Mufan Bill Li, Maxime Gazeau

We propose a novel approach to analyze generalization error for discretizations of Langevin diffusion, such as the stochastic gradient Langevin dynamics (SGLD). For an $\epsilon$ tolerance of expected generalization erro…

Hybrid Iterative Solvers with Geometry-Aware Neural Preconditioners for Parametric PDEs

2025-12-16 · Youngkyu Lee, Francesc Levrero Florencio, Jay Pathak, George Em Karniadakis arxiv

The convergence behavior of classical iterative solvers for parametric partial differential equations (PDEs) is often highly sensitive to the domain and specific discretization of PDEs. Previously, we introduced hybrid s…