Skip to content

Particle Dynamics of Flow Matching and Classifier-Free Guidance from a Stagewise Geometry Perspective

Sep 2026 · 0 citations
Computer Science

TL;DR

A unified stagewise geometric theory of attraction and absorption is established for both continuous dynamics and explicit Euler discretization of flow matching and CFG across continuous and discrete sampling.

Abstract

Flow matching, together with classifier-free guidance (CFG), is widely used in generative modeling, yet much of the theoretical understanding remains distribution-wise. Since practical sampling follows individual trajectories, distribution-level guarantees alone do not fully capture how trajectories interact with the data geometry or how guidance reshapes it. To overcome this limitation, we establish a unified stagewise geometric theory of attraction and absorption for both continuous dynamics and explicit Euler discretization. Specifically, with $t\in[0,1]$ running from noise to data, we show that unconditional flow trajectories are successively attracted toward a neighborhood of the global mean, the data convex hull, and a neighborhood of a possibly nonconvex local cluster. Across these stages, the corresponding distance satisfies a common contraction estimate, yielding an ${O}(1-t)$ decay of the distance in the final stage. For CFG, the same structure persists with an extrapolated mean, an inflated conditional convex hull, and, near the target cluster, the restored local geometry of conditional flow matching. We further show that a general time schedule $a(t)$ replaces the $O(1-t)$ decay by $O(1-a(t))$. Together, these results provide a unified particle-level geometric account of flow matching and CFG across continuous and discrete sampling.

View source

Similar papers

Preprint Aug 2026

A Lagrangian View of Flow Matching

Modern explicit-time generative models, such as Flow Matching [Lipman et al., 2023] and Rectified Flow [Liu et al., 2023], are typically derived top-down via Optimal Transport and the continuity equation. This standard Eulerian approach focuses on the macroscopic transport of probability mass. In this paper, we present...

P. Milanfar · 0 citations
#machine learning Preprint Oct 2026

Smoother Flow Matching via Contrastive Trajectory Repulsion

Trajectory crossing remains a critical bottleneck in Flow Matching (FM), and previous works typically view these crossings from a theoretical optimization perspective causing velocity averaging. They attempt to address it indirectly by post-hoc distillation or endpoint coupling, without explicitly regulating the interm...

Zi-Qi Jiang, Zhen-Qi He, Long Chen · 0 citations
#machine learning Preprint Sep 2026

CAT-Flow: Curvature-Adaptive sTeps for Flow Matching

Two lightweight, training-free algorithms are proposed, CAT-OV and CAT-OT that adapt step-sizes at inference time based on a novel connection between Flow Matching sampling and gradient flow that outperform existing step-size heuristics in image quality metrics across four text- to-image Flow Matching models.

Qinchan Li, Pedro Cisneros-Velarde, Ke-Ru Fu et al. · 0 citations
Preprint Oct 2026

Flatness-Based Geometric Path Following via Guiding Vector Fields

Path following requires an agent to converge to and traverse a geometric path without a prescribed timing law. Guiding vector fields (GVFs) address this directly, but as guidance laws they offer no mechanism to compensate for the agent's own dynamics. Differential flatness-based control (DFBC), on the other hand, compe...

J. VanGool, Héctor García de Marina, B. Jayawardhana et al. · 0 citations
Preprint Sep 2026

Classifier-Free Guidance in Flow Matching: Non-Autonomous Potentials, Overshoot, and Posterior-Mean Control

Classifier-free guidance (CFG) improves conditional generation in Flow Matching, but strong guidance can distort the generated distribution and reduce diversity. We provide a geometric account of this behavior by viewing Flow Matching as a time-varying gradient flow and characterizing how CFG reshapes its underlying po...

Ji-Shen Peng, Zheng Ma · 0 citations
#machine learning Preprint Sep 2026

Manifold-Stable Flow Matching

This work introduces manifold-stable flow matching (MSFM), which can start from an arbitrary ambient prior, not necessarily supported on the manifold, and guarantees manifold invariance and transverse convergence to the manifold within a desired time window.

Amirhossein Nazerian, A. Pezeshki, Jian-Guo Zhao · 0 citations

Related blog posts

MIT News · Artificial Intelligence Oct 7, 2026

Discovering the value of humanistic inquiry

Students in MIT’s Concourse program delve deeply into the human condition, debate challenging questions, and learn to develop judgment about issues that can’t be quantified.

Microsoft Research Blog Oct 7, 2026

Agent Lightning v1.0: A 3,500-Line Lightweight Agentic RL Framework for Training Agents with Real Harnesses

Training AI agents with reinforcement learning can be challenging because their tools, context, and decision-making are managed by complex frameworks. Agent Lightning connects existing agents to RL training, making it easier to improve them without rebuilding them. The post Agent Lightning v1.0: A 3,500-Line Lightweight Agentic RL Framework for Training Agents with Real Harnesses appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.