Skip to content
Preprint

One-Sided Quantile Coupling for Flow Matching

Aug 2026 · 0 citations · 40 references
Computer Science

TL;DR

Quantile Coupling Flow Matching is proposed, a lightweight one-sided coupling that improves over the Baseline under matched training budgets, reduces FID by up to 12.9%, and outperforms OT-CFM on all four datasets.

Abstract

Flow Matching trains continuous-time generative models by regressing the velocity field of a probability path between a simple source distribution and a target data distribution. The coupling that pairs source and target samples strongly affects optimization and sample quality, but structured couplings typically rely on mini-batch transport or assignment procedures whose cost grows at least quadratically in batch size. We propose Quantile Coupling Flow Matching (QC-FM), a lightweight one-sided coupling: rather than matching two pre-sampled batches, it samples only the data batch and constructs each paired source directly. Data ranks projected along a small number of random orthogonal directions are mapped to Gaussian quantiles, and the latent code is completed in the orthogonal complement by conditional Gaussian sampling. The construction is one-dimensional per slice, so the coupling requires no pairwise cost matrix and no assignment to solve. We show that, for each drawn frame, this coupling eliminates the irreducible regression variance along every selected slice and makes the ideal flow exactly straight there, while leaving the sampling prior unchanged: generation still starts from the standard Gaussian, and the training source deviates from it only through the copula of the slice codes, whose transport cost we bound. For training, we apply QC to an anchor subset and complete the remaining source slots with exact Gaussian samples, retaining the QC bias while preserving an explicit signal from the Baseline coupling. Across CIFAR-10, CelebA, FFHQ, and ImageNet-64, QC-FM improves over the Baseline under matched training budgets, reducing FID by up to 12.9%, and outperforms OT-CFM on all four datasets. These results suggest that preserving projected rank structure is a simple and scalable way to inject useful geometric bias into FM couplings without solving a mini-batch transport problem.

View source

Similar papers

#machine learning Preprint Sep 2026

Beyond Straightness: Non-Crossing Flow Matching via Quantile AlignTree Coupling

Quantile AlignTree Flow Matching (QAT-FM), an efficient structured coupling strategy that constructs a hierarchical coupling between a Gaussian prior and the target data distribution via a quantile-aligned tree structure, is proposed, enabling scalable training for large-scale high-dimensional generative tasks.

Jun-Yi Lin, Meng-Yu Li, Jing-Xuan Hu et al. · 0 citations
Preprint Aug 2026

Difficulty-Calibrated Interpolation Paths for Conditional Flow Matching

This work shows that the regression difficulty of Conditional Flow Matching varies systematically along the path, and proposes Difficulty-Calibrated Flow Matching, which derives the schedule from the model itself: a short pilot run with the linear path records the per-time loss, and the schedule is set to the quantile...

Airin Akter Tania, Md Raihan Khan · 2 citations
Jul 2026

Latent-Kernel Discrete Flow Maps for Few-Step Generation

Latent-Kernel Discrete Flow Maps (LKF), a from-scratch flow-map kernel that is a mixture of M factorized components tied by a single shared latent that learns strongly heterogeneous components and improves generative perplexity by 2.1x to 3.3x over the likelihood baselines without losing diversity.

Mansoor Ahmed, Yue-Tsz Fan, Hemanth Venkateswara et al. · 0 citations
Preprint Aug 2026

A Factor Graph Approach to Scalable Multi-Output Gaussian Process Regression

Multi-output Gaussian process regression scales cubically in the number of observations times outputs, and dense kernel-matrix methods need bespoke handling whenever different outputs are observed at different inputs. We express multi-output Gaussian process regression as a Forney-style factor graph in which a nearest-...

Wouter W. L. Nuijten, Esther G. van Pelt, Albert Podusenko et al. · 0 citations
Preprint Aug 2026

Limit Points of Reflow with Minibatch Optimal Transport

Reflow accelerates inference by iteratively straightening the trajectories induced by this vector field, and it is proved that reflow limits coincide with the optimal transport map between the endpoint distributions.

A. Chambolle, Johannes Hertrich · 1 citation
Preprint Aug 2026

Structured Dimension-Matched Joint Variational Transdimensional Inference

This work introduces structured dimension-matched variational transdimensional inference (SM-VTI) for finite enumerable model spaces and develops a rooted construction graph that expresses a model as a sequence of local stop/child decisions.

P. Yin, Xi-Yun Jiao · 0 citations

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