Difficulty-Calibrated Interpolation Paths for Conditional Flow Matching

arXiv:2608.21286v1 Announce Type: new Abstract: Conditional Flow Matching trains generative models by regressing a network onto the velocity of a prescribed noise-to-data interpolation path. The interpolation schedule that shapes this path is known to affect convergence and sample quality, yet it is invariably fixed in advance, independent of both the data and the model. We show that the regression difficulty of Conditional Flow Matching varies systematically along the path, and we propose Difficulty-Calibrated Flow Matching, which derives the schedule from the model itself: a short pilot run with the linear path records the per-time loss, and the schedule is set to the quantile function of this difficulty profile, so the trajectory lingers where the velocity is hardest to learn. The method has a single hyperparameter, leaves the training objective and its gradient equivalence intact, composes with classifier-free guidance, and adds about two percent training overhead. In controlled experiments on CIFAR-10, MNIST, and Fashion-MNIST with an identical compact U-Net, the calibrated path attains the best FID on CIFAR-10 at full sampling budget and clearly outperforms all fixed schedules in the large-batch, few-update regime, precisely the setting where compute is scarcest.

Related

• Noise-Robust Conditional Flow Matching: Generating Clean Samples from Noisy Datasets
• Generative Modeling with Orbit-Space Particle Flow Matching
• SubFlow: Sub-mode Conditioned Flow Matching for Diverse One-Step Generation
• ODE-free Neural Flow Matching for One-Step Generative Modeling

Source: arXiv cs.CV | 2026-08-24