Difficulty-Calibrated Interpolation Paths for Conditional Flow Matching

• URL: http://arxiv.org/abs/2608.21286v1
• Date: Fri, 21 Aug 2026 16:42:52 GMT
• Title: Difficulty-Calibrated Interpolation Paths for Conditional Flow Matching
• Abstract summary: Conditional Flow Matching trains generative models by regressing a network onto the velocity of a prescribed noise-to-data path.<n>We show that the regression difficulty of Conditional Flow Matching varies systematically along the path.<n>We propose Difficulty-Calibrated Flow Matching, which derives the schedule from the model itself.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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 papers

• AnyFlow: Any-Step Video Diffusion Model with On-Policy Flow Map Distillation [70.80207977907908]
  We introduce AnyFlow, the first any-step video diffusion distillation framework based on flow maps.<n>We show that AnyFlow achieves performance matches or surpasses consistency-based counterparts in the few-step regime.
  arXiv  Detail & Related papers  (2026-05-13T16:06:34Z)
• ODE-free Neural Flow Matching for One-Step Generative Modeling [4.319549155064877]
  Diffusion and flow matching models generate samples by learning time-dependent vector fields whose integration transports noise to data.<n>We propose Optimal Transport Neural Flow Matching (OT-NFM), an ODE-free generative framework that parameterizes the flow map with neural flows.<n>We show that naive flow-map training suffers from mean collapse, where inconsistent noise-data pairings drive all outputs toward the data mean.
  arXiv  Detail & Related papers  (2026-04-07T19:49:57Z)
• Training-Free Refinement of Flow Matching with Divergence-based Sampling [17.850801452423074]
  Flow Divergence Sampler (FDS) is a training-free framework that refines intermediate states before each solver step.<n>FDS exploits this signal to steer states toward less ambiguous regions.<n>As a plug-and-play framework compatible with standard solvers and off-the-shelf flow backbones, FDS consistently improves fidelity across various generation tasks.
  arXiv  Detail & Related papers  (2026-04-06T12:54:58Z)
• FlowConsist: Make Your Flow Consistent with Real Trajectory [99.22869983378062]
  We argue that current fast-flow training paradigms suffer from two fundamental issues.<n> conditional velocities constructed from randomly paired noise-data samples introduce systematic trajectory drift.<n>We propose FlowConsist, a training framework designed to enforce trajectory consistency in fast flows.
  arXiv  Detail & Related papers  (2026-02-06T03:24:23Z)
• Temporal Pair Consistency for Variance-Reduced Flow Matching [13.328987133593154]
  Temporal Pair Consistency (TPC) is a lightweight variance-reduction principle that couples velocity predictions at paired timesteps along the same probability path.<n>Instantiated within flow matching, TPC improves sample quality and efficiency across CIFAR-10 and ImageNet at multiple resolutions.
  arXiv  Detail & Related papers  (2026-02-04T00:05:21Z)
• Generative Modeling with Continuous Flows: Sample Complexity of Flow Matching [60.37045080890305]
  We provide the first analysis of the sample complexity for flow-matching based generative models.<n>We decompose the velocity field estimation error into neural-network approximation error, statistical error due to the finite sample size, and optimization error due to the finite number of optimization steps for estimating the velocity field.
  arXiv  Detail & Related papers  (2025-12-01T05:14:25Z)
• FlowDrive: moderated flow matching with data balancing for trajectory planning [5.553127690929986]
  FlowDrive is a flow-matching trajectory planner that learns a conditional rectified flow to map noise directly to trajectory distributions.<n>FlowDrive achieves state-of-the-art results among learning-based planners and approaches methods with rule-based refinements.
  arXiv  Detail & Related papers  (2025-09-26T06:49:22Z)
• Consistency Flow Matching: Defining Straight Flows with Velocity Consistency [97.28511135503176]
  We introduce Consistency Flow Matching (Consistency-FM), a novel FM method that explicitly enforces self-consistency in the velocity field. Preliminary experiments demonstrate that our Consistency-FM significantly improves training efficiency by converging 4.4x faster than consistency models.
  arXiv  Detail & Related papers  (2024-07-02T16:15:37Z)
• Consistency Trajectory Models: Learning Probability Flow ODE Trajectory of Diffusion [56.38386580040991]
  Consistency Trajectory Model (CTM) is a generalization of Consistency Models (CM) CTM enables the efficient combination of adversarial training and denoising score matching loss to enhance performance. Unlike CM, CTM's access to the score function can streamline the adoption of established controllable/conditional generation methods.
  arXiv  Detail & Related papers  (2023-10-01T05:07:17Z)
• Manifold Interpolating Optimal-Transport Flows for Trajectory Inference [64.94020639760026]
  We present a method called Manifold Interpolating Optimal-Transport Flow (MIOFlow) MIOFlow learns, continuous population dynamics from static snapshot samples taken at sporadic timepoints. We evaluate our method on simulated data with bifurcations and merges, as well as scRNA-seq data from embryoid body differentiation, and acute myeloid leukemia treatment.
  arXiv  Detail & Related papers  (2022-06-29T22:19:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.