Improving Function Space Flow Matching with Kernel Optimal Transport
Read the original on Hugging Face Trending Papers →The Flow has not summarised this story yet — read it at Hugging Face Trending Papers.
The Flow has not summarised this story yet — read it at Hugging Face Trending Papers.
arXiv:2609.38049v1 Announce Type: new Abstract: Generative models for function-valued data, such as time series and solutions of partial differential equations, must learn distributions over infinite...
The paper introduces COFM, a framework for consistent optimal transport flow matching that uses partially input convex neural networks (PICNN) to parameterize the transport potential. By adding a Hamilton‑Jacobi residual to the training objective, COFM enforces dynamical consistency and supports both one‑step transport and multi‑step ODE sampling without costly inner optimization. Experiments on benchmark datasets show that COFM achieves competitive performance while reducing L^2‑UVP by over 2× and cutting computational time by about 9× compared to state‑of‑the‑art models.
arXiv:2509.26364v3 Announce Type: replace Abstract: The Schr\"odinger bridge problem is concerned with finding a stochastic dynamical system bridging two marginal distributions that minimises a certa...
The paper presents a method that combines flow‑matching models with energy‑based modeling to explicitly construct scalar energy functions for physical fields. These energies are derived from a matching regression objective on a linear Gaussian interpolation, avoiding variational approximations or extra MCMC steps, and can be used for energy‑corrected data generation, out‑of‑distribution detection, and posterior sampling in inverse problems. The approach enables general MCMC samplers that reduce PDE residuals and spectral distance, and it demonstrates that combining data‑driven and physics‑based energies improves OOD detection accuracy.
The paper investigates diffusion models trained in a lazy high‑dimensional regime, extending benign overfitting theory to generative settings. By analyzing denoising score matching in a vector‑valued RKHS with an inner‑product kernel, the authors derive exact risk trajectories under gradient flow when the number of samples scales proportionally with dimensionality. These trajectories reveal three distinct phases—spectral generalization, noise‑dominated interpolation, and empirical Bayes memorization—whose interplay shapes the distribution of generated samples.
arXiv:2606. 04092v1 Announce Type: cross Abstract: Flow matching models learn to transport samples from a simple prior distribution to a complex data distribution.