arXiv Statistics ML By Thomas Bonis, Thanh Mai Pham Ngoc, Viet Chi Tran

Optimal score function estimation via derivatives constraints

Read the original on arXiv Statistics ML →

The paper develops a statistical framework showing that empirical score matching can achieve minimax optimal performance for diffusion generative models when data lie on a low‑dimensional manifold. It establishes convergence rates for empirical risk minimization over constrained Sobolev classes and demonstrates that the resulting score estimators yield minimax optimal Wasserstein‑1 rates for the generated distribution, up to logarithmic factors. The analysis reveals that the statistical rates depend on the intrinsic dimension of the data manifold rather than its ambient dimension, providing conditions under which score‑based generative modeling generalizes rather than overfits.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Statistics ML.

arXiv Machine Learning
Aug 10

Convergence of Diffusion Models Under the Manifold Hypothesis in High-Dimensions

arXiv:2409. 18804v3 Announce Type: replace-cross Abstract: Denoising Diffusion Probabilistic Models (DDPM) are powerful state-of-the-art methods used to generate synthetic data from high-dimensional data distributions and are widely used for image, audio, and video generation as well as many more applications in science and beyond.

By Iskander Azangulov, George Deligiannidis, Judith Rousseau
arXiv Machine Learning
Oct 2

Manifold-Aware Perturbations for Constrained Generative Modeling

The paper introduces a new method for perturbing data distributions in a way that respects equality constraints, allowing generative models to better handle constrained data. By adjusting the distribution while preserving the manifold geometry, the approach ensures support matches the ambient space dimension. Experiments with diffusion models and normalizing flows demonstrate improved data recovery and stable sampling across several tasks.

By Katherine Keegan, Lars Ruthotto