Diffusion Models with Heavy-Tailed Targets: Score Estimation and Sampling Guarantees
Yifeng Yu, Lu Yu

TL;DR
This paper analyzes score-based diffusion models for heavy-tailed data, deriving minimax rates for score estimation and sampling guarantees, and highlighting differences between exponential and polynomial tail decay.
Contribution
It extends diffusion model theory to heavy-tailed distributions, providing sharp minimax rates and sampling guarantees under broad tail conditions.
Findings
Sharp minimax rates for score estimation under heavy tails
Sampling guarantees with convergence rates depending on tail decay
Extension of diffusion models beyond light-tailed assumptions
Abstract
Score-based diffusion models have become a powerful framework for generative modeling, with score estimation as a central statistical bottleneck. Existing guarantees for score estimation largely focus on light-tailed targets or rely on restrictive assumptions such as compact support, which are often violated by heavy-tailed data in practice. In this work, we study conventional (Gaussian) score-based diffusion models when the target distribution is heavy-tailed and belongs to a Sobolev class with smoothness parameter . We consider both exponential and polynomial tail decay, indexed by a tail parameter . Using kernel density estimation, we derive sharp minimax rates for score estimation, revealing a qualitative dichotomy: under exponential tails, the rate matches the light-tailed case up to polylogarithmic factors, whereas under polynomial tails the rate depends…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMarkov Chains and Monte Carlo Methods · Stochastic processes and statistical mechanics · Bayesian Methods and Mixture Models
