COT-FM: Cluster-wise Optimal Transport Flow Matching

• URL: http://arxiv.org/abs/2603.13395v1
• Date: Wed, 11 Mar 2026 13:52:17 GMT
• Title: COT-FM: Cluster-wise Optimal Transport Flow Matching
• Abstract summary: Flow Matching models often produce curved trajectories due to random or batchwise couplings.<n>COT-FM fixes this by clustering target samples and assigning each cluster a dedicated source distribution.<n>As a plug-and-play approach, COT-FM consistently accelerates sampling and improves generation quality across 2D datasets, image generation benchmarks, and robotic manipulation tasks.
• Score: 5.771040439456201
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce COT-FM, a general framework that reshapes the probability path in Flow Matching (FM) to achieve faster and more reliable generation. FM models often produce curved trajectories due to random or batchwise couplings, which increase discretization error and reduce sample quality. COT-FM fixes this by clustering target samples and assigning each cluster a dedicated source distribution obtained by reversing pretrained FM models. This divide-and-conquer strategy yields more accurate local transport and significantly straighter vector fields, all without changing the model architecture. As a plug-and-play approach, COT-FM consistently accelerates sampling and improves generation quality across 2D datasets, image generation benchmarks, and robotic manipulation tasks.

Related papers

• Posterior Augmented Flow Matching [64.1559809786948]
  Posterior-Augmented Flow Matching (PAFM) is a generalization of flow matching (FM)<n>We show that PAFM improves over FM by up to 3.4 FID50K across different model scales.
  arXiv  Detail & Related papers  (2026-05-01T17:59:59Z)
• Faster Inference of Flow-Based Generative Models via Improved Data-Noise Coupling [69.7108839028336]
  Conditional Flow Matching (CFM) is a simulation-free method for training continuous normalizing flows.<n>We introduce LOOM-CFM, a novel method to extend the scope of minibatch optimal transport (OT) by preserving and optimizing these assignments across minibatches over training time.<n>Our approach demonstrates consistent improvements in the sampling speed-quality trade-off across multiple datasets.
  arXiv  Detail & Related papers  (2026-03-16T13:42:28Z)
• OAT-FM: Optimal Acceleration Transport for Improved Flow Matching [31.693019737039496]
  Flow Matching (FM) aims to learn velocity fields from noise to data.<n>We bridge FM and the recent theory of Optimal Acceleration Transport (OAT)<n>We develop an improved FM method called OAT-FM and explore its benefits in both theory and practice.
  arXiv  Detail & Related papers  (2025-09-29T15:36:27Z)
• Beyond Optimal Transport: Model-Aligned Coupling for Flow Matching [59.972540297208766]
  Flow Matching (FM) is an effective framework for training a model to learn a vector field that transports samples from a source distribution to a target distribution.<n>We propose Model- Coupling Coupling (MAC), an effective method that matches training couplings based on geometric distance.<n>Experiments show that MAC significantly improves generation quality and efficiency in few-step settings compared to existing methods.
  arXiv  Detail & Related papers  (2025-05-29T11:10:41Z)
• DFM: Interpolant-free Dual Flow Matching [0.8192907805418583]
  We propose an interpolant-free dual flow matching (DFM) approach without explicit assumptions about the modeled vector field. Experiments with the SMAP unsupervised anomaly detection show advantages of DFM when compared to the CNF trained with either maximum likelihood or FM objectives.
  arXiv  Detail & Related papers  (2024-10-11T20:46:04Z)
• Local Flow Matching Generative Models [19.859984725284896]
  Flow Matching (FM) is a simulation-free method for learning a continuous and invertible flow to interpolate between two distributions.<n>We introduce a stepwise FM model called Local Flow Matching (LFM), which consecutively learns a sequence of FM sub-models.<n>We empirically demonstrate improved training efficiency and competitive generative performance of LFM compared to FM.
  arXiv  Detail & Related papers  (2024-10-03T14:53:10Z)
• Consistency Flow Matching: Defining Straight Flows with Velocity Consistency [97.28511135503176]
  We introduce Consistency Flow Matching (Consistency-FM), a novel FM method that explicitly enforces self-consistency in the velocity field. Preliminary experiments demonstrate that our Consistency-FM significantly improves training efficiency by converging 4.4x faster than consistency models.
  arXiv  Detail & Related papers  (2024-07-02T16:15:37Z)
• Straighter Flow Matching via a Diffusion-Based Coupling Prior [29.38872850098043]
  We propose Straighter trajectories of Flow Matching (StraightFM)<n>It straightens trajectories with the coupling strategy from the entire distribution level.<n> Experimental results on pixel space and latent space show that StraightFM yields attractive samples within 5 steps.
  arXiv  Detail & Related papers  (2023-11-28T06:19:30Z)
• Improving and generalizing flow-based generative models with minibatch optimal transport [90.01613198337833]
  We introduce the generalized conditional flow matching (CFM) technique for continuous normalizing flows (CNFs) CFM features a stable regression objective like that used to train the flow in diffusion models but enjoys the efficient inference of deterministic flow models. A variant of our objective is optimal transport CFM (OT-CFM), which creates simpler flows that are more stable to train and lead to faster inference.
  arXiv  Detail & Related papers  (2023-02-01T14:47:17Z)
• Over-the-Air Federated Learning from Heterogeneous Data [107.05618009955094]
  Federated learning (FL) is a framework for distributed learning of centralized models. We develop a Convergent OTA FL (COTAF) algorithm which enhances the common local gradient descent (SGD) FL algorithm. We numerically show that the precoding induced by COTAF notably improves the convergence rate and the accuracy of models trained via OTA FL.
  arXiv  Detail & Related papers  (2020-09-27T08:28:25Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.