A Theory on Flow Matching with Neural Networks
arXiv:2606. 10089v1 Announce Type: cross Abstract: In this work, we develop theoretical foundation for flow matching with neural-network-parameterized conditional velocity fields.
The paper presents Conditional Föllmer Flow, an ODE‑based deep generative approach for learning conditional distributions. Starting from a Gaussian, the flow approximates the target distribution near time 1, with Euler discretization and a neural‑network‑estimated velocity field. The authors prove convergence in Wasserstein‑2 distance and demonstrate superior performance on both nonparametric density estimation and image‑based tasks compared to existing methods.
arXiv:2606. 10089v1 Announce Type: cross Abstract: In this work, we develop theoretical foundation for flow matching with neural-network-parameterized conditional velocity fields.
arXiv:2510. 12636v5 Announce Type: replace-cross Abstract: The default Gaussian latent in flow-based generative models poses challenges when learning certain distributions such as heavy-tailed ones.
arXiv:2208.11782v2 Announce Type: replace Abstract: In the absence of conditioning information, normalizing flow models are trained using maximum likelihood. Previous extensions to conditional settin...
arXiv:2604. 04342v2 Announce Type: replace Abstract: Many data-driven decision problems are formulated using a nominal distribution estimated from historical data, while performance is ultimately determined by a deployment distribution that may be shifted, context-dependent, partially observed, or stress-induced.
Efficient Covariance-Aware Vicinal Latent Diffusion (CAViLD) is a latent diffusion framework designed for continuous conditional image generation. It builds a purified, condition-aware latent space using density-adaptive vicinal learning, auxiliary semantic regularization, and NIQE-guided negative data augmentation. CAViLD incorporates an EMA teacher to internalize conditional guidance, enabling single-branch inference, and employs covariance-aware progressive distillation to reduce sampling steps to four NFEs, achieving a balance between fidelity, condition consistency, and efficiency on datasets such as RC-49, UTKFace, and Steering Angle.
arXiv:2606. 01002v1 Announce Type: cross Abstract: Engression is a recently proposed and effective framework for conditional distribution learning.
This paper introduces a generative model that minimizes the second‑order Wasserstein loss (W₂) by solving a distribution‑dependent ordinary differential equation (ODE) whose dynamics involve the Kantorovich potential of the true data distribution and its current estimate. The authors prove that the time‑marginal laws of this ODE form a gradient flow for the W₂ loss, converging exponentially to the true data distribution, and propose an Euler scheme that recovers this gradient flow in the limit. An algorithm based on this scheme, combined with persistent training, is shown in experiments to outperform Wasserstein GANs in both low‑ and high‑dimensional settings when the level of persistent training is appropriately increased.
arXiv:2411. 08314v5 Announce Type: replace Abstract: Learning to transform conditional probability densities over time is a fundamental challenge spanning probabilistic modeling and the natural sciences.
arXiv:2608. 19504v1 Announce Type: new Abstract: We propose a conditioning mechanism for diffusion models based on multi-speed joint diffusion of the target and the condition.
arXiv:2607. 16685v1 Announce Type: cross Abstract: Conditional diffusion models have become a powerful and flexible framework for learning complex conditional distributions from labeled data.
arXiv:2609.12953v1 Announce Type: new Abstract: Flow matching approaches to imaging inverse problems commonly incorporate measurements in two ways. Conditioning-based approaches supply measurement-de...
arXiv:2607. 27723v1 Announce Type: cross Abstract: Engression (Shen and Meinshausen, 2024) learns a conditional distribution by fitting a generative model $Y = f(X,\varepsilon)$ under the energy score, a strictly proper scoring rule.