REVIEW 7 cited by
Unveil Conditional Diffusion Models with Classifier-free Guidance: A Sharp Statistical Theory
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Unveil Conditional Diffusion Models with Classifier-free Guidance: A Sharp Statistical Theory
read the original abstract
Conditional diffusion models serve as the foundation of modern image synthesis and find extensive application in fields like computational biology and reinforcement learning. In these applications, conditional diffusion models incorporate various conditional information, such as prompt input, to guide the sample generation towards desired properties. Despite the empirical success, theory of conditional diffusion models is largely missing. This paper bridges this gap by presenting a sharp statistical theory of distribution estimation using conditional diffusion models. Our analysis yields a sample complexity bound that adapts to the smoothness of the data distribution and matches the minimax lower bound. The key to our theoretical development lies in an approximation result for the conditional score function, which relies on a novel diffused Taylor approximation technique. Moreover, we demonstrate the utility of our statistical theory in elucidating the performance of conditional diffusion models across diverse applications, including model-based transition kernel estimation in reinforcement learning, solving inverse problems, and reward conditioned sample generation.
Forward citations
Cited by 7 Pith papers
-
Transformer Approximations from ReLUs
A recipe translates ReLU approximations to softmax attention with target-specific economic bounds for multiplication, reciprocal computation, and min/max primitives.
-
Improved Sample Complexity For Diffusion Model Training Without Empirical Risk Minimizer Access
The paper establishes an O(ε^{-4}) sample complexity bound for score estimation in diffusion models without requiring access to the empirical risk minimizer.
-
Causality-Encoded Diffusion Models for Interventional Sampling and Edge Inference
Causality-encoded diffusion models use a known DAG to train graph-consistent conditional diffusions for observational recovery, interventional sampling via fixed-variable propagation, and a resampling-based directed e...
-
Diffusion Models for Adaptive Sequential Data Generation
Introduces a sequential forward-backward diffusion framework that generates adapted time series by conditioning on prior history, with a parallelizable score-matching objective and statistical guarantees for ReLU networks.
-
Multi-Objective Learning for Diffusion Models: A Statistical Theory under Semi-Supervised Learning
A semi-supervised MOL framework for diffusion models with generalization bounds depending only on specialist model complexity, extended to diffusion policies for sequential decisions.
-
A note on connections between the F\"ollmer process and the denoising diffusion probabilistic model
Discretized Föllmer processes supply hyper-parameter settings for DDPM samplers that recover state-of-the-art sampling error bounds with slight improvements.
-
Parametric Prior Mapping Framework for Non-stationary Probabilistic Time Series Forecasting
PPM injects parametric structural priors into generative models via a learnable mapping to improve probabilistic forecasts on non-stationary MTS data.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.