analiza aiqbench
This paper gives statistical guarantees for diffusion models that learn a shared "pooled" score across related distributions plus a small target-specific correction, a setup relevant when data for the target group is scarce. It derives convergence rates showing when the correction is cheaper to learn than fitting a separate model, and total-variation bounds for diffusion models used as density estimators. The evidence is limited to synthetic simulations and image benchmarks offered as proof of concept, so practitioners should treat the rates as theory-level guidance until they are validated at scale.
Two-Stage Score Estimation for Group-Specific Diffusion Models
arXiv:2610.20979v1 Announce Type: cross Abstract: Generative modeling across related distributions raises a question: how can shared structure support accurate generation for a target distribution with limited observations? We develop a statistical framework for diffusion transfer that analyzes a shared pooled score together with a target-specific offset. Under Besov regularity of the pooled density and a stable hierarchical composition model for the offset, we derive convergence rates that separate the costs of learning these components and identify when a simpler offset yields a faster risk-bound rate than separate fitting. Under suitable boundary and regularity assumptions, we prove that the offset remains bounded and jointly regular as diffusion time approaches zero. These results allow the lower time cutoff to vanish polynomially and provide total-variation guarantees for diffusion models as density estimators. Synthetic simulations and image benchmarks provide a proof of concept for the framework.
Abstract:Generative modeling across related distributions raises a question: how can shared structure support accurate generation for a target distribution with limited observations? We develop a statistical framework for diffusion transfer that analyzes a shared pooled score together with a target-specific offset. Under Besov regularity of the pooled density and a stable hierarchical composition model for the offset, we derive convergence rates that separate the costs of learning these components and identify when a simpler offset yields a faster risk-bound rate than separate fitting. Under suitable boundary and regularity assumptions, we prove that the offset remains bounded and jointly regular as diffusion time approaches zero. These results allow the lower time cutoff to vanish polynomially and provide total-variation guarantees for diffusion models as density estimators. Synthetic simulations and image benchmarks provide a proof of concept for the framework.
Machine Learning (stat.ML); Machine Learning (cs.LG); Statistics Theory (math.ST)
arXiv:2610.20979 [stat.ML]
(or arXiv:2610.20979v1 [stat.ML] for this version)
https://doi.org/10.48550/arXiv.2610.20979 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 237 cuvinte
Subiecte conexe

Frontier Risk Report (February to March 2026)
METR · 19 mai 2026

Informe de riesgos de la IA de frontera (febrero–marzo de 2026)
METR · 19 mai 2026

Frontier AI Risk Report (February–March 2026)
METR · 19 mai 2026

Deconfusing Corrigibility
AI Alignment Forum · 17 oct. 2026