Model-Aware Schedules Improve Generation via Fiberwise Optimal Transport
On the map: Diffusion models → Flow matching, time series and science
Abstract (arXiv)
Diffusion and flow-matching schedules control the signal and noise coefficients that mix data and noise along affine probability paths. Minimizing a kinetic action defined on coefficient paths, motivated by optimal transport, helps explain strong baselines but remains model-agnostic and ignores prediction error. Here we introduce a model-aware schedule construction based on fiberwise optimal transport. At a fixed time and state on the probability path, compatible signal/noise decompositions form an affine fiber. We define a fiberwise prediction risk by averaging optimal-transport costs between the true and predictor-induced decompositions within these fibers. On a fixed coefficient curve, combining this risk with coefficient-path kinetic action yields a closed-form optimal time allocation. This construction extends to general linear prediction targets, and the risk profile can be estimated from an early baseline checkpoint. We evaluate DDPMs and flow matching across prediction targets, training configurations, risk-estimation checkpoints, datasets, and architectures. Our model-aware schedules consistently outperform strong baselines, including a 38.6% relative FID reduction for flow matching on CIFAR-10 at 16 function evaluations. Each model-agnostic kinetic baseline determines its own kinetic reference coordinate. In these coordinates, fiberwise-risk profiles from independently trained models in different settings align closely after normalization to unit area. The resulting schedule deformations used in training also align, suggesting empirical universality across the evaluated models and settings. Pretrained-checkpoint diagnostics extend this normalized-risk agreement to larger conditional latent diffusion and 2-RF models. A frozen analytic allocation template retains most of the model-aware improvement without further risk estimation or model-specific fitting.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Flow matching, time series and science, one of 14 directions in Diffusion models. Builds on 35 of its 43 references that are in the map. First posted on arXiv 10 Sep 2026.
Builds on
35 of 43 references.
Closest ancestors · 10
Same direction, newest first
- 2026Difficulty-Calibrated Interpolation Paths for Conditional Flow Matching21 Aug
- 2026Velocity Scheduled Flow Matching13 Jul
- 2024Improving the Training of Rectified Flows30 May
- 2024Conditional Wasserstein Distances with Applications in Bayesian OT Flow Matching27 Mar
- 2023Bellman Optimal Stepsize Straightening of Flow-Matching Models27 Dec
- 2023InstaFlow: One Step is Enough for High-Quality Diffusion-Based Text-to-Image Generation12 Sep
- 2023Multisample Flow Matching: Straightening Flows with Minibatch Couplings28 Apr
- 2023Improving and generalizing flow-based generative models with minibatch optimal transport1 Feb
- 2022Flow Matching for Generative Modeling6 Oct
- 2022Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flow7 Sep
Other references · 25
- 2020Denoising Diffusion Probabilistic Modelscited by 21,076
- 2015U-Net: Convolutional Networks for Biomedical Image Segmentationcited by 19,713
- 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,863
- 2014Microsoft COCO: Common Objects in Contextcited by 17,608
- 2020Denoising Diffusion Implicit Modelscited by 9,781
- 2021Diffusion Models Beat GANs on Image Synthesiscited by 8,255
- 2022Scalable Diffusion Models with Transformerscited by 6,054
- 2022Classifier-Free Diffusion Guidancecited by 5,847
- 2024Scaling Rectified Flow Transformers for High-Resolution Image Synthesiscited by 4,181
- 2021Improved Denoising Diffusion Probabilistic Modelscited by 3,761
- 2022DPM-Solver++: Fast Solver for Guided Sampling of Diffusion Probabilistic Modelscited by 938
- 2022All are Worth Words: A ViT Backbone for Diffusion Modelscited by 502
13 more
- 2017A Downsampled Variant of ImageNet as an Alternative to the CIFAR datasetscited by 377
- 2023Common Diffusion Noise Schedules and Sample Steps are Flawedcited by 310
- 2024Align Your Steps: Optimizing Sampling Schedules in Diffusion Modelscited by 96
- 2024On the Trajectory Regularity of ODE-based Diffusion Samplingcited by 55
- 2023On Kinetic Optimal Probability Paths for Generative Modelscited by 42
- 2024Improved Noise Schedule for Diffusion Trainingcited by 39
- 2024LayoutFlow: Flow Matching for Layout Generationcited by 21
- 2025Lipschitz-Guided Design of Interpolation Schedules in Generative Modelscited by 17
- 2025Entropic Time Schedulers for Generative Diffusion Modelscited by 16
- 2025Optimal Scheduling of Dynamic Transportcited by 13
- 2026Noise Scheduling as Information-Guided Allocation in Diffusion Trainingcited by 7
- 2025Diagnosing and Improving Diffusion Models by Estimating the Optimal Loss Valuecited by 5
- 2024Constant Rate Scheduling: A General Framework for Optimizing Diffusion Noise Schedule via Distributional Changecited by 1
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026Prediction--Loss Alignment for Sampler--Robust Flow Matching Training
- 2026Gaussian Flow-Matching Schedules: Implications for Sampling and Training
- 2026Scaling Online Optimal Transport Minibatches for Flow Matching
- 2025The Curse of Conditions: Analyzing and Improving Optimal Transport for Conditional Flow-Based Generation
- 2026Expected Batch Optimal Transport Plans and Consequences for Flow Matching
- 2026Correcting CondOT: Exact Finite-Step Sampling in Gaussian Flow Matching
- 2025Shortcutting Pre-trained Flow Matching Diffusion Models is Almost Free Lunch
- 2025Beyond Optimal Transport: Model-Aligned Coupling for Flow Matching