mlsanityData to 14 Oct 2026

Free Denoising Diffusion Models

arXiv 2510.22778 ↗First posted 26 Oct 2025math.PR cs.LG stat.MLcited by 0

On the map: Diffusion models → Diffusion foundations and sampling

Abstract (arXiv)

A growing class of machine-learning objects -- covariance and Gram matrices, kernel and attention matrices, MIMO channel matrices, density operators -- are naturally spectra rather than coordinate vectors. Building a denoising diffusion model for such data by corrupting eigenvalues coordinatewise is not merely elegant: it converges to the wrong limit, because eigenvalues repel rather than move independently. Free probability theory supplies the correct forward process, with free convolution replacing classical convolution and Voiculescu's conjugate variable replacing the score, but constant-coefficient free diffusions have a hidden limitation of their own: their only possible equilibrium is the semicircular law, whatever the target distribution looks like. We show that state-dependent free volatility removes this restriction. For any sufficiently regular compactly supported target law, we explicitly construct, through a closed-form Hilbert-transform drift, a free Fokker--Planck flow having that law as a stationary spectral distribution. Under an additional convex-potential condition, the construction admits a globally relaxing diffusion interpretation, reverse-time dynamics, and a trainable score. The generalization is genuine rather than cosmetic: no change of spectral variable reduces it to the constant-coefficient case, and it is a Wasserstein gradient flow only for an explicitly characterized family of coefficients that contains no bounded non-constant member. We instantiate the construction on the Marchenko--Pastur law, the limiting spectrum of isotropic sample covariance matrices, and validate it numerically: the free-versus-coordinatewise gap, an exact dimension-independent score driving reverse-time matrix dynamics at several matrix sizes, the designed Marchenko--Pastur equilibrium, and end-to-end generation with a learned score.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Diffusion foundations and sampling, one of 14 directions in Diffusion models. Builds on 6 of its 57 references that are in the map. First posted on arXiv 26 Oct 2025.

Builds on

6 of 57 references.

Closest ancestors · 4

Same direction, newest first

  1. 2022Riemannian Diffusion Models16 Aug
  2. 2022Riemannian Score-Based Generative Modelling6 Feb
  3. 2020Score-Based Generative Modeling through Stochastic Differential Equations26 Nov
  4. 2020Denoising Diffusion Probabilistic Models19 Jun

Other references · 2

  1. 2015Deep Unsupervised Learning using Nonequilibrium Thermodynamicscited by 7,058
  2. 2018The Emergence of Spectral Universality in Deep Networkscited by 74

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2024Non-asymptotic bounds for forward processes in denoising diffusions: Ornstein-Uhlenbeck is hard to beat
  2. 2023Using Ornstein-Uhlenbeck Process to understand Denoising Diffusion Probabilistic Model and its Noise Schedules
  3. 2026Wasserstein bounds for denoising diffusion probabilistic models via the F"ollmer process
  4. 2024Denoising Diffusions with Optimal Transport: Localization, Curvature, and Multi-Scale Complexity
  5. 2024Structural and Convergence Analysis of Discrete-Time Denoising Diffusion Probabilistic Models
  6. 2025Assessing the Quality of Denoising Diffusion Models in Wasserstein Distance: Noisy Score and Optimal Bounds
  7. 2023A Note on the Convergence of Denoising Diffusion Probabilistic Models
  8. 2023Restoration-Degradation Beyond Linear Diffusions: A Non-Asymptotic Analysis For DDIM-Type Samplers