cs.LGFeb 2, 2026

Unlocking the Duality between Flow and Field Matching

Authors: Daniil Shlenskii, Alexander Varlamov, Nazar Buzun, Alexander Korotin

Organizations: AXXX, Russia · Applied AI Institute, Russia · Kandinsky Lab, Russia · Innopolis University, Russia

Abstract

Conditional Flow Matching (CFM) unifies conventional generative paradigms such as diffusion and flow-based models. Interaction Field Matching (IFM) is a recently proposed framework that generalizes Electrostatic Field Matching (EFM), rooted in Poisson Flow Generative Models (PFGM). While both frameworks define generative dynamics, they start from different objects: CFM specifies a conditional probability path in data space, whereas IFM specifies a physics-inspired interaction field in an augmented data space. This raises a basic question: are CFM and IFM genuinely different, or are they two descriptions of the same underlying dynamics? We show that they coincide for a natural subclass of IFM, which we call forward-only IFM. Specifically, we give explicit constructions in both directions and show that CFM and forward-only IFM induce the same family of data-space dynamics. General IFM, however, is strictly more expressive: already in EFM, its sampling rule yields transport maps that reverse orientation with positive probability, something no CFM flow can do. Our findings suggest using the probabilistic and geometric views jointly when developing generative models, and exploring field-based transport beyond the forward-only regime.

Figures & tables

Appendix figures & tables11 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

Oct 3, 2024

Local Flow Matching Generative Models

Flow Matching (FM) is a simulation-free method for learning a continuous, invertible flow that interpolates between two distributions, and in particular generates data from noise. Inspired by the variational nature of the diffusion process as a gradient flow, we introduce a stepwise FM model, Local Flow Matching (LFM), which sequentially learns a sequence of FM submodels, each matching a diffusion process up to the time-step size in the data-to-noise direction. In each step, the two distributions to be interpolated by the sub-flow model are closer than those in the full-flow matching model, which interpolates data to noise distributions, enabling smaller models with more efficient training. This variational perspective also allows us to prove a theoretical generation guarantee for the proposed flow model in terms of the χ2χ^2-divergence between the generated and true data distributions, leveraging the contraction property of the diffusion process. In practice, the stepwise structure of LFM is naturally amenable to model distillation, and various distillation techniques can be applied to accelerate generation. We empirically demonstrate that LFM achieves competitive generative performance compared to FM on unconditional generation of tabular and image datasets, and on conditional generation of robotic manipulation policies.
May 17, 2026

Drift Flow Matching

Iterative generative models such as Flow Matching and Diffusion models have demonstrated strong test-time scaling behavior, where additional inference computation can improve generation quality. In contrast, Drift Models offer efficient one-step generation, but their direct generation paradigm limits such flexibility. In this work, we propose Drift Flow Matching (DFM), a framework that connects drifting generative modeling with flow-based iterative generation. DFM preserves the efficiency of direct transport maps while enabling generation to be refined through multiple inference steps when desired. This bridges the gap between one-step Drift Models and multi-step Flow Matching methods, and provides a novel generative paradigm that can adapt sampling computation to different quality--efficiency requirements. Extensive experiments across different tasks and datasets demonstrate the effectiveness and generality of the proposed framework.
Jul 27, 2026

Joint Flow Matching: Consistent Generative and Discriminative Inference from a Shared Flow

We study Joint Flow Matching (JFM), a flow-based framework for learning a joint distribution over paired variables such as images and class labels. JFM transports the variables in opposite directions: an image is transported from noise to data while its label is transported from data to noise. This provides a single probabilistic model in which generation and classification are represented as complementary conditional inferences. We formulate the joint distribution induced by this construction and characterise the relationship between its forward and reverse conditionals. We investigate the resulting model for classification and conditional generation, including confidence calibration and consistency between generated samples and classifier predictions. Experiments on conditional datasets demonstrate competitive classification accuracy, well-calibrated confidence without post-hoc calibration, and classifier-consistent generation. We further explore the shared joint distribution as a basis for interpreting the relationship between discriminative and generative behaviour.