Flow Matching is Adaptive to Manifold Structures

2026-02-25

AI Summary

This work addresses a key limitation in existing flow matching theory, which assumes that the target distribution possesses a full-dimensional smooth density—an assumption violated by data supported on low-dimensional manifolds, despite empirical success in such settings. Focusing on flow matching with linear interpolation, this paper establishes the first non-asymptotic convergence guarantees when the target distribution is supported on a smooth manifold. By modeling the dynamics via ordinary differential equations, employing nonparametric estimation on the manifold, and conducting a careful error propagation analysis, the authors demonstrate that the convergence rate depends only on the intrinsic dimension of the manifold and the smoothness of the target distribution restricted to it. This result circumvents the curse of dimensionality and achieves a near-minimax optimal rate.

Technology Category

• Machine Learning: Learning with Manifolds
• Search and Optimization: Non-convex Optimization
• Intelligent Robots: State Estimation

Application Category

• Graph Algorithms and Modeling for the Web: Efficient manipulation of static and dynamic Web-related graphs
• User Modeling, Personalization and Recommendation: On-Device user modeling, personalization, and recommendation
• Security and Privacy: Large-scale security measurements

Abstract

Flow matching has emerged as a simulation-free alternative to diffusion-based generative modeling, producing samples by solving an ODE whose time-dependent velocity field is learned along an interpolation between a simple source distribution (e.g., a standard normal) and a target data distribution. Flow-based methods often exhibit greater training stability and have achieved strong empirical performance in high-dimensional settings where data concentrate near a low-dimensional manifold, such as text-to-image synthesis, video generation, and molecular structure generation. Despite this success, existing theoretical analyses of flow matching assume target distributions with smooth, full-dimensional densities, leaving its effectiveness in manifold-supported settings largely unexplained. To this end, we theoretically analyze flow matching with linear interpolation when the target distribution is supported on a smooth manifold. We establish a non-asymptotic convergence guarantee for the learned velocity field, and then propagate this estimation error through the ODE to obtain statistical consistency of the implicit density estimator induced by the flow-matching objective. The resulting convergence rate is near minimax-optimal, depends only on the intrinsic dimension, and reflects the smoothness of both the manifold and the target distribution. Together, these results provide a principled explanation for how flow matching adapts to intrinsic data geometry and circumvents the curse of dimensionality.

Problem

• Flow Matching
• Manifold Structure
• Generative Modeling
• Curse of Dimensionality
• Statistical Consistency

Innovation

• flow matching
• manifold learning
• non-asymptotic convergence
• intrinsic dimension
• statistical consistency