Gradient Variance Reveals Failure Modes in Flow-Based Generative Models
Teodora Reu, Sixtine Dromigny, Michael Bronstein, Francisco Vargas
TL;DR
This work reveals that gradient variance can diagnose fundamental failure modes in flow-based generative models, showing that deterministic training of Rectified Flows can cause memorization of training pairings even when interpolants intersect, thereby hindering true transport. The authors develop a Gaussian-to-Gaussian analytic framework and extend to finite data, proving that the minimizer can memorize exact data pairings (Prop. det_rect) and that stochastic interpolation or noisy pairings break memorization, restoring generalization. Empirical validation on Mixtures of Gaussians and CelebA demonstrates that deterministic interpolants induce memorization, while injecting noise improves OT alignment and sample quality; adversarial and simulated 1-ReFlow experiments further illustrate the perils of determinism and the efficacy of noise. These findings challenge the reliability of purely deterministic Rectified Flows and emphasize the need for stochasticity to guide models toward proper transport, with implications for OT-based learning and fast inference in flow-based generative modeling.
Abstract
Rectified Flows learn ODE vector fields whose trajectories are straight between source and target distributions, enabling near one-step inference. We show that this straight-path objective conceals fundamental failure modes: under deterministic training, low gradient variance drives memorization of arbitrary training pairings, even when interpolant lines between pairs intersect. To analyze this mechanism, we study Gaussian-to-Gaussian transport and use the loss gradient variance across stochastic and deterministic regimes to characterize which vector fields optimization favors in each setting. We then show that, in a setting where all interpolating lines intersect, applying Rectified Flow yields the same specific pairings at inference as during training. More generally, we prove that a memorizing vector field exists even when training interpolants intersect, and that optimizing the straight-path objective converges to this ill-defined field. At inference, deterministic integration reproduces the exact training pairings. We validate our findings empirically on the CelebA dataset, confirming that deterministic interpolants induce memorization, while the injection of small noise restores generalization.
