← All papers

Flow Matching for Generative Modeling

Lipman, Chen, Ben-Hamu, Nickel, Le (Meta) · 2023 · ICLR 2023

GenerationRead on arXiv

Introduces a simulation-free framework for training Continuous Normalizing Flows by regressing vector fields along conditional probability paths, offering simpler training and faster sampling than diffusion models.

Key Idea

Flow Matching trains a neural network to predict a velocity field that transports samples from a simple noise distribution to the data distribution along smooth, straight-line paths. Unlike diffusion models (which add/remove noise via stochastic processes), Flow Matching defines deterministic ODE trajectories between noise and data, making both training and sampling simpler and more efficient.

How It Works

  • Continuous Normalizing Flows (CNFs): define a time-dependent velocity field v(x, t) that transforms noise x₀ into data x₁ via an ODE: dx/dt = v(x, t)
  • Conditional Flow Matching: instead of learning the marginal vector field directly (intractable), regress against conditional vector fields along simple paths between paired noise-data samples
  • Optimal Transport paths: use straight-line interpolation x_t = (1-t)·x₀ + t·x₁ between noise and data. These are the shortest paths (OT displacement interpolant), leading to faster convergence than the curved paths in diffusion
  • Training objective: minimize ||v_θ(x_t, t) - (x₁ - x₀)||², predict the direction from noise to data at each timestep
  • Sampling: solve the ODE forward from noise using an off-the-shelf ODE solver (Euler, RK45). Fewer steps needed than diffusion (often 20-50 vs 100-1000)

Why It Matters

  • Simpler than diffusion: no forward/reverse SDE, no noise schedules to tune, no score matching, just vector field regression along straight lines
  • Faster sampling: ODE paths are straighter, requiring fewer integration steps. 10-50 steps vs 100-1000 for DDPM
  • Powers modern generative models: Stable Diffusion 3, FLUX, Meta's Movie Gen, and most 2025-era image/video generators use Flow Matching instead of traditional diffusion
  • Theoretically clean: subsumes diffusion as a special case (curved Gaussian paths are one instance of the general Flow Matching framework)
  • Extensible: works for images, video, audio, 3D, and any continuous data modality

Key Takeaways for Interviews

  • Flow Matching = learn a velocity field along straight ODE paths from noise to data
  • vs Diffusion: diffusion uses stochastic forward/reverse processes (SDE); Flow Matching uses deterministic ODE with straight-line paths, simpler, faster, same or better quality
  • The Optimal Transport interpolant (straight lines) is key, it makes paths short and training efficient
  • Training loss is just MSE on velocity prediction: ||v_θ(x_t, t) - (x₁ - x₀)||²
  • In system design: mention Flow Matching when discussing modern image/video generation, it's what SD3 and FLUX use under the hood
  • Know the progression: VAE → GAN → Diffusion (DDPM) → Flow Matching, each generation simpler and more scalable