Joint Flow Matching for Generator-Consistent Classification

Hayden McAlister, Lech Szymanski
7/27/2026
cs.LG

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

We introduce Joint Flow Matching (JFM), a training framework for continuous normalising flows over multiple variables. Standard flow matching transports variables from noise to data simultaneously, offering no natural mechanism for forward and reverse conditional inference from a shared joint model. JFM resolves this by assigning opposite roles to each variable at the temporal endpoints. We prove that JFM produces a consistent joint distribution where that forward or reverse integration are conditionals of the same joint. We explore this consistency in the context of joint classification and generation as the basis for interpretability in discriminative-generative models. We validate JFM on conditional datasets producing competitive accuracy with inherently well-calibrated confidence scores without post-hoc calibration, and classifier-consistent image generation.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{mcalister2026joint,
  title  = {Joint Flow Matching for Generator-Consistent Classification},
  author = {Hayden McAlister and Lech Szymanski},
  year   = {2026},
  eprint = {2607.23946},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2607.23946v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2607.23946.svg)](https://codeofpaper.com/paper/2607.23946)

Discussion