Skip to content
AI.info

Research

Overcoming the Curvature Bottleneck in MeanFlow

Overcoming the Curvature Bottleneck in MeanFlow Overview Research area: Generative modeling in computer vision — specifically one-step flow-based image generation, trajectory straightening (rectified

Overcoming the Curvature Bottleneck in MeanFlow
arXiv
2511.23342
Published
2025-11-28
Authors
Xinxi Zhang, Shiwei Tan, Quang Nguyen, Quan Dao, Ligong Han, Xiaoxiao He, Tunyu Zhang, Chengzhi Mao, Dimitris Metaxas, Vladimir Pavlovic

AI summary

Overcoming the Curvature Bottleneck in MeanFlow

Overview

  • Research area: Generative modeling in computer vision — specifically one-step flow-based image generation, trajectory straightening (rectified flow), and knowledge distillation.
  • Technical level: Advanced. The paper assumes familiarity with flow matching, probability-flow ODEs, mean-velocity fields, classifier-free guidance, and FID evaluation.
  • Scope in one sentence: The paper diagnoses trajectory curvature as the cause of a rugged loss landscape in MeanFlow and proposes Re-MeanFlow, a data-free self-distillation method that trains the mean-velocity field on rectified (straighter) couplings.

What This Paper Is About

One-step generative models like MeanFlow learn a mean-velocity field so that an image can be produced in a single network evaluation instead of many numerical integration steps. The authors find that when this field is learned over the highly curved trajectories produced by standard independent data-noise coupling, the training objective becomes spiky and poorly conditioned, which slows convergence and degrades sample quality. Their goal is to remove that bottleneck by learning the same mean-velocity field over trajectories that have been straightened.

Key Contributions

  1. Identification of a curvature bottleneck. The authors show that the difficulty of one-step flow generation stems partly from the geometry of the underlying trajectories: curved paths make the interval mean-velocity a rapidly varying function of the input, producing a rugged loss landscape.
  2. Re-MeanFlow, a data-free self-distillation method. The method performs one reflow step with a pretrained flow model to build a rectified coupling, then trains MeanFlow on that coupling. It requires only a pretrained model and prior samples — no access to the original training dataset.
  3. A distance-based truncation heuristic. Motivated by an observed correlation between endpoint distance and trajectory curvature, the method discards the top 10% of couplings ranked by ℓ₂ endpoint distance, removing residual high-curvature pairs.
  4. A curvature diagnostic and empirical validation. The paper defines an angle-based curvature proxy, Curv(r, t), measuring directional disagreement between the average transport direction over [r, t] and the instantaneous velocity at t, and uses it to verify that rectified couplings are substantially straighter.

Main Findings

  • FID improvement over baseline MeanFlow: Re-MeanFlow improves the FID of baseline MeanFlow models from 30.9 to 8.6 under the same training budget.
  • Comparison with 2-rectified flow++: Re-MeanFlow outperforms 2-rectified flow++ by 33.4% in FID while running 26x faster (the paper also states it reduces FID by 33.4% while using only 10% of the compute, and reports being 26.6× faster in GPU hours).
  • ImageNet 64² one-step results (NFE = 1): Re-MeanFlow (initialized from EDM2-S) reaches FID 2.87, versus 2-rectified flow++ at 4.31, iCT at 4.02, ECD-S at 3.30, sCD-S at 2.97, TCM at 2.88, and AYF at 2.98.
  • ImageNet 256² one-step results: Re-MeanFlow reaches FID 3.41, slightly surpassing MeanFlow at 3.43, and well ahead of iMM (7.77), iSM (5.27), SM (10.6), and iCT (34.6). Notably, this is achieved without real-image supervision.
  • ImageNet 512² one-step results: Re-MeanFlow reaches FID 3.03, versus AYF at 3.32 (a 9% FID gain), CMT at 3.38, sCD-S at 3.07, ECD at 8.47, ECT at 9.98, and sCT-S at 10.13.
  • Smoother loss landscape: Visualizing the MeanFlow loss on a PCA plane of z_t with t = 0.7 and r ∈ {0.7, 0.5, 0.3, 0.1}, the baseline landscape becomes sharper and more irregular as t − r grows, while Re-MeanFlow's remains substantially smoother and better-conditioned across all r.
  • Faster convergence and better one-step fidelity: After 20k iterations, MeanFlow's one-step samples remain blurry, whereas Re-MeanFlow's are already sharp after 10k iterations. The distribution of the one-step versus multi-step discrepancy ‖x_mul − x_one‖ is strongly left-shifted for Re-MeanFlow.
  • Compute advantage: On ImageNet 64², Re-MeanFlow achieves the lowest end-to-end compute among recent distillation approaches — 2.9× faster than AYF in GPU hours, and its training cost accounts for only 17% of the total GPU hours used by AYF.
  • Truncation strength matters: On ImageNet 512², FID/IS are 3.50/242.62 with no truncation, 3.10/251.84 at top 5%, 3.03/262.37 at top 10%, and 3.19/259.61 at top 15%, with comparable precision/recall (diversity preserved).
  • No truncation still competitive: Even without truncation, Re-MeanFlow matches MeanFlow trained from scratch on real data (ImageNet 512²: 3.50 FID vs. the MeanFlow baseline in Table 2 reported at 3.43 on 256²).
  • Ablation results (ImageNet 512²): Starting from the best-setting baseline in MeanFlow at 7.81 FID, hyperparameter adjustments give 7.22, changing the time embedding gives 4.60, the U-shaped t distribution gives 3.71, avoiding the high-variance (r, t) region gives 3.50, and distance-based truncation gives 3.03.

Methodology in Plain English

The starting point is a pretrained flow or diffusion model. Instead of training the new one-step model on the original pairing of noise and data — which produces sharply bending trajectories — the authors first generate a large set of data-noise pairs by running that pretrained model's ODE. The paper uses 5M such pairs for ImageNet-64² and ImageNet-512², initialized from EDM2-S, and from SiT-XL for ImageNet-256². This reflow step produces a "rectified" coupling whose paths are measurably straighter.

The mean-velocity network is then initialized from the teacher and trained on these rectified pairs using the MeanFlow objective, which relates the mean velocity over an interval, the instantaneous velocity, and the time derivative of the mean velocity via a stop-gradient target. Because the paths are straighter, the regression target varies more gently with the input.

Two practical refinements are added. First, since long endpoint distances correlate with higher curvature, the top 10% of pairs by ℓ₂ endpoint distance are discarded. Second, guidance is handled in two stages: train without guidance first, then briefly fine-tune with the classifier-free guidance objective (guidance is applied via CFG at ImageNet-256² and Autoguidance at 64² and 512²). Several implementation details from the baseline were also adjusted for the straighter regime — reducing the adaptive-loss normalization strength from 1.0 to 0.5, replacing the EDM2 time embedding emb(log σ_t) with emb(t), using the U-shaped t distribution, and excluding the region where t > 0.95 and r < 0.4 because of unusually high variance.

Why This Matters

Impact on research. The paper reframes one-step generation as partly a conditioning problem rather than purely a capacity or objective-design problem. It provides a concrete diagnostic (an angle-based curvature proxy over (r, t)) and shows that the geometry of the coupling, not just the loss function, determines how hard the learning problem is. This connects the trajectory-straightening literature (Rectified Flow, OT-CFM) with the flow-map and consistency-model literature, and it offers a compute profile that moves most expense into an inference-only sampling stage that can run on inference-grade accelerators.

Real-world applications (implied by fast one-step image generation; the paper does not enumerate specific applications itself):

  • Interactive image creation tools where a single forward pass per image is required for responsive user interfaces.
  • Large-scale content pipelines that must generate many images under tight latency budgets.
  • On-device or edge generation, since one-step sampling avoids iterative solver loops.
  • Lower-cost research iteration on generative models where repeated training runs are the main expense.

Industry relevance. The paper emphasizes that distillation pipelines normally require high-end training GPUs, making hyperparameter tuning and repeated runs prohibitively expensive. Re-MeanFlow shifts most computation to reflow-style coupling generation followed by a lightweight training phase, which the authors argue makes the workflow feasible on consumer- or inference-grade hardware. It also removes the need to access the original training dataset, which matters where data is proprietary, licensed, or otherwise unavailable.

Future Directions

  • Incorporating real data. The authors note as a limitation that the method relies entirely on synthetic couplings, and that a promising direction is to incorporate real data into training, as explored in prior work.
  • Improving synthetic supervision. They suggest using stronger backbone models to generate the couplings, or drawing on work that improves generative models using only their own outputs with appropriate regularization.
  • Characterizing the curvature–distance relationship. The truncation rule is a heuristic built on an empirical correlation between endpoint distance and curvature; a fuller theoretical account of when this correlation holds, and how much truncation is optimal, remains open.
  • Comparison with concurrent work. The appendix positions Re-MeanFlow against the concurrent CMT method, which supervises few-step models with teacher ODE trajectories, leaving open how these supervision strategies combine.

Target Audience

Researchers and graduate students working on diffusion and flow-based generative models, few-step or one-step distillation, and efficient training for image synthesis. It is also relevant to practitioners who need one-step image generators under tight compute or latency constraints, and to anyone interested in how the geometry of probability paths shapes optimization difficulty. Readers without background in flow matching and ODE-based sampling will find the mathematical development in Section 3 difficult without additional reading.

Authors’ abstract

MeanFlow offers a promising framework for one-step generative modeling by directly learning a mean-velocity field, bypassing expensive numerical integration. However, we find that the highly curved generative trajectories of existing models induce a noisy loss landscape, severely bottlenecking convergence and model quality. We leverage a fundamental geometric principle to overcome this: mean-velocity estimation is drastically simpler along straight paths. Building on this insight, we propose Rectified MeanFlow, a self-distillation approach that learns the mean-velocity field over a straightened velocity field, induced by rectified couplings from a pretrained model. To further promote linearity, we introduce a distance-based truncation heuristic that prunes residual high-curvature pairs. By smoothing the optimization landscape, our method achieves strong one-step generation performance. We improve the FID of baseline MeanFlow models from 30.9 to 8.6 under same training budget, and outperform the recent 2-rectified flow++ by 33.4% in FID while running 26x faster. Our work suggests that the difficulty of one-step flow generation stems partially from the rugged optimization landscapes induced by curved trajectories. Code is available at https://github.com/Xinxi-Zhang/Re-MeanFlow.

Read the original paper