Continuous-time generative frameworks construct probability paths between base and target domains by optimizing time-dependent velocity fields. While theoretical targets favor straight trajectories, empirical networks develop complex path deformations.
arXiv:2608. 01692v1 Announce Type: new Abstract: We propose an instantiation of flow matching that relies on a time-independent velocity field (an \emph{autonomous flow}) to exactly map between two distributions, so long as the target is singular, i.
By Lee Cheuk-Kit, Florentin Coeurdoux, Peter Potaptchik, Yilun Du, Michael Samuel Albergo, Eric Vanden-Eijnden
The paper introduces a flow matching framework that unifies various neural representational dissimilarity metrics under a single theoretical umbrella. By interpreting these metrics as Jeffreys divergences with different velocity constraints, the authors demonstrate that flow matching improves distance estimation for complex distributions and continuous variables. The framework also facilitates the principled design of new dissimilarity measures.
By Zeyuan Ye, Xue-Xin Wei
arXiv:2606. 02177v1 Announce Type: new Abstract: Flow Matching typically relies on white noise sources, a choice often misaligned with the power spectra of natural data, which tend to decay with frequency.
By Francesco M. Ruscio, T. Konstantin Rusch
arXiv:2606. 05327v1 Announce Type: new Abstract: Flow matching (FM) has emerged as a powerful framework for learning dynamic transport maps between two empirical distributions.
By Raghav Kansal, David Crair, Nghia Nguyen, Scott Pope, Bradley Parry
arXiv:2606. 07481v1 Announce Type: new Abstract: While Computational Fluid Dynamics (CFD) provides high-fidelity flow fields for optimizing indoor environments, its computational cost limits rapid exploration.
By Chris R. Jung, Markus D\"orr, Natalie J\"ungling, Jennifer Niessner, Adam T. M\"uller, Nicolaj C. Stache