Saved in:
Bibliographic Details
Main Authors: Lin, Jinhong, Wang, Pan, Zhan, Zitong, Zhang, Lin, Morgado, Pedro
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2604.07397
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866917392190275584
author Lin, Jinhong
Wang, Pan
Zhan, Zitong
Zhang, Lin
Morgado, Pedro
author_facet Lin, Jinhong
Wang, Pan
Zhan, Zitong
Zhang, Lin
Morgado, Pedro
contents A key inefficiency in diffusion training occurs when a randomly initialized network, lacking visual priors, encounters gradients from the full complexity spectrum--most of which it lacks the capacity to resolve. We propose Data Warmup, a curriculum strategy that schedules training images from simple to complex without modifying the model or loss. Each image is scored offline by a semantic-aware complexity metric combining foreground dominance (how much of the image salient objects occupy) and foreground typicality (how closely the salient content matches learned visual prototypes). A temperature-controlled sampler then prioritizes low-complexity images early and anneals toward uniform sampling. On ImageNet 256x256 with SiT backbones (S/2 to XL/2), Data Warmup improves IS by up to 6.11 and FID by up to 3.41, reaching baseline quality tens of thousands of iterations earlier. Reversing the curriculum (exposing hard images first) degrades performance below the uniform baseline, confirming that the simple-to-complex ordering itself drives the gains. The method combines with orthogonal accelerators such as REPA and requires only ~10 minutes of one-time preprocessing with zero per-iteration overhead.
format Preprint
id arxiv_https___arxiv_org_abs_2604_07397
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Data Warmup: Complexity-Aware Curricula for Efficient Diffusion Training
Lin, Jinhong
Wang, Pan
Zhan, Zitong
Zhang, Lin
Morgado, Pedro
Machine Learning
Artificial Intelligence
A key inefficiency in diffusion training occurs when a randomly initialized network, lacking visual priors, encounters gradients from the full complexity spectrum--most of which it lacks the capacity to resolve. We propose Data Warmup, a curriculum strategy that schedules training images from simple to complex without modifying the model or loss. Each image is scored offline by a semantic-aware complexity metric combining foreground dominance (how much of the image salient objects occupy) and foreground typicality (how closely the salient content matches learned visual prototypes). A temperature-controlled sampler then prioritizes low-complexity images early and anneals toward uniform sampling. On ImageNet 256x256 with SiT backbones (S/2 to XL/2), Data Warmup improves IS by up to 6.11 and FID by up to 3.41, reaching baseline quality tens of thousands of iterations earlier. Reversing the curriculum (exposing hard images first) degrades performance below the uniform baseline, confirming that the simple-to-complex ordering itself drives the gains. The method combines with orthogonal accelerators such as REPA and requires only ~10 minutes of one-time preprocessing with zero per-iteration overhead.
title Data Warmup: Complexity-Aware Curricula for Efficient Diffusion Training
topic Machine Learning
Artificial Intelligence
url https://arxiv.org/abs/2604.07397