Abra: Scaling Diffusion Image Training

Hugging Face Daily Papers Papers

Summary

This paper presents a systematic scaling law study for text-to-image diffusion models, showing they scale predictably but require significantly more data per parameter than language models for optimal training.

Compute-optimal scaling laws guide the training of frontier language models yet remain largely unexplored for visual generation. We present a systematic scaling law study for text-to-image diffusion models using Abra, a controlled family of flow-matching transformers trained across three orders of magnitude worth of compute (10^{19} to 10^{22} FLOPs), reaching significantly larger compute budgets than previous works. We demonstrate that diffusion models scale just as predictably as language models but require far more data to train optimally: compute optimality occurs at approximately 200 image tokens per parameter, ten times the Chinchilla compute-optimal prescription for LLMs. We show that unlike language models, diffusion models are robust to overtraining and that practitioners should err on the side of more data rather than a larger model. Finally, we show that this predictability extends beyond training loss to generative quality metrics, optimal CFG settings, representation quality, and even the shape of the training curves, which collapse onto a universal form.
Original Article
View Cached Full Text

Cached at: 08/19/26, 03:58 AM

Paper page - Abra: Scaling Diffusion Image Training

Source: https://huggingface.co/papers/2608.17286

Abstract

Scaling laws for text-to-image diffusion models reveal predictable compute-optimal training requiring far more data per parameter than language models, with robust overtraining behavior and universal curve shapes.

Compute-optimalscaling lawsguide the training of frontier language models yet remain largely unexplored for visual generation. We present a systematic scaling law study fortext-to-image diffusion modelsusing Abra, a controlled family offlow-matching transformerstrained across three orders of magnitude worth of compute (10^{19} to 10^{22} FLOPs), reaching significantly larger compute budgets than previous works. We demonstrate that diffusion models scale just as predictably as language models but require far more data to train optimally: compute optimality occurs at approximately 200 image tokens per parameter, ten times theChinchillacompute-optimalprescription for LLMs. We show that unlike language models, diffusion models are robust to overtraining and that practitioners should err on the side of more data rather than a larger model. Finally, we show that this predictability extends beyond training loss togenerative quality metrics, optimalCFGsettings,representation quality, and even the shape of the training curves, which collapse onto a universal form.

View arXiv pageView PDFAdd to collection

Models citing this paper0

No model linking this paper

Cite arxiv.org/abs/2608.17286 in a model README.md to link it from this page.

Datasets citing this paper0

No dataset linking this paper

Cite arxiv.org/abs/2608.17286 in a dataset README.md to link it from this page.

Spaces citing this paper0

No Space linking this paper

Cite arxiv.org/abs/2608.17286 in a Space README.md to link it from this page.

Collections including this paper0

No Collection including this paper

Add this paper to acollectionto link it from this page.

Similar Articles

Scaling Properties of Text Conditioning in Visual Generation

Hugging Face Daily Papers

This paper studies empirical scaling properties for text conditioning in visual generation, showing that converged diffusion loss scales with structured language in prompts, and introduces methods to improve diffusability and promptability.

Scaling laws for neural language models

OpenAI Blog

Foundational empirical study demonstrating power-law scaling relationships between language model performance and model size, dataset size, and compute budget, with implications for optimal training allocation and sample efficiency.

i1: A Simple and Fully Open Recipe for Strong Text-to-Image Models

Hugging Face Daily Papers

The paper introduces i1, a 3B-parameter text-to-image diffusion model that achieves competitive performance with leading closed models while being fully open (weights, data, code). It provides insights from 300+ controlled experiments and offers a practical recipe for open research.