Model Releases
Beyond Straightness: Non-Crossing Flow Matching via Quantile AlignTree Coupling
arXiv:2609.03443v1 Announce Type: new Abstract: The performance of Flow Matching largely depends on the quality of the coupling between the source and target distributions. However, independent coupli
arXiv:2609.03443v1 Announce Type: new Abstract: The performance of Flow Matching largely depends on the quality of the coupling between the source and target distributions. However, independent coupling often leads to path crossings and local velocity ambiguity, while OT-based couplings typically incur high construction costs. To address this challenge, we propose 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. QAT-FM constructs the coupling in O(Ndlog N) time and supports per-pair source sampling with O(d) complexity, enabling scalable training for large-scale high-dimensional generative tasks. Theoretically, we prove that the QAT coupling satisfies marginal consistency, induces non-crossing linear interpolation paths, and consistently improves path separation at intermediate times compared with independent coupling, thereby alleviating local velocity ambiguity. QAT-FM further extends naturally to conditional generation, enabling structured conditional coupling while preserving global Gaussian alignment. Experiments across diverse benchmark datasets demonstrate that QAT-FM achieves competitive generative performance while substantially reducing coupling construction cost.
Related
- Generative Inverse Design with Abstention via Diagonal Flow Matching
- Path-independent Flow Matching for Multi-parameter Generative Dynamics
- COFM: Consistent Optimal Transport Flow Matching via Partially Input Convex Neural Networks
- Multi-Fidelity Flow Matching: Cascaded Refinement of PDE Solutions
- Guided Flow Matching for Forward and Inverse PDE Problems with Sparse Observations: Algorithm and Theory
Source: arXiv cs.LG | 2026-09-04