cs.LGNov 14, 2026

Explicit Regularization for Flow Matching

Authors: Lars Ruthotto, Eran Treister

Organizations: Departments of Mathematics and Computer Science, Emory University, Atlanta, GA, USA · Faculty of Computer and Information Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel

Abstract

Learning the underlying probability distribution from samples is a core problem in statistics and applied mathematics. Generative models based on diffusion and flow matching learn a velocity field whose flow transports a known distribution to the data distribution. They produce novel, realistic samples, although the empirical learning problem is ill posed near the data distribution. Its minimizer transports the samples onto the training data, and small perturbations of the data change the velocity field strongly near the end of the flow. The observed generalization is often attributed to implicit regularization by the network parameterization, early stopping of the training, and the time integration during sampling. Explicit regularization has advanced the theory and computation of many inverse problems and has recently been proposed to prevent memorization in generative models. With a regularizer on the magnitude of the velocity, however, the field approaches the memorizing velocity unless the regularization parameter grows to infinity fast enough, and it then stays bounded by a constant that is small only for large parameters. We show that penalizing the derivatives of order kk of the velocity renders the DD-dimensional empirical problem well posed uniformly in time if 2k>D2k > D and the training points are in general position. Our experiments in one and two dimensions discretize the velocity with splines and use direct solvers for the regularized least-squares problems to exclude optimization error. Refining the discretization in space and time changes the error of the Hessian-regularized flows only marginally, whereas without the regularizer the error tends to that of memorization. These flows generalize, with errors comparable to or lower than those of well-tuned kernel density estimates.

Figures & tables

Explore similar work

CardsList
  1. Generative Modeling with Continuous Flows: Sample Complexity of Flow Matching

    Nov 1, 2026Mudit Gaur, Prashant Trivedi, Shuchin Aeron +3Flow MatchingFlow-Based Generative Modeling

  2. Generalization Bounds for Flow-matching Generative Models for Intrinsically Low-dimensional Data

    Oct 2, 2026Saptarshi Chakraborty, Quentin Berthet, Peter L. BartlettFlow MatchingFlow-Based Generative Modeling

  3. Flow Matching under Noisy Latent Structure: Beyond Exact Low-Dimensional Support

    Sep 30, 2026Lifeng Hao, Shaolin JiFlow MatchingFlow-Based Generative Modeling