The decomposition provides a theoretical basis for adapting likelihood-based LLM methods to flow matching, while distinguishing exact substitutions from controlled surrogates, while distinguishing exact substitutions from controlled surrogates.
Abstract
Flow matching enables likelihood-free training, yet alignment methods increasingly reuse conditional flow matching (CFM) losses as endpoint negative log-likelihoods (NLLs) and their old/new differences as log-likelihood ratios. We characterize when these substitutions are valid. For linear Gaussian paths, we exactly decompose endpoint NLL into entropy, a weighted CFM objective, an interior velocity--score residual, and a boundary residual. Thus CFM-only estimates and differences are exact only when the corresponding residuals cancel. At the off-policy population optimum, ordinary CFM is not generally a pointwise NLL estimator, whereas \(w_{\mathrm{sc}}(t)=(1-t)/t\) removes the interior residual; this positive result does not extend generally to training or on-policy alignment. On-policy log-ratios can remain biased even for identical endpoint laws or after surrogate optimization. Experiments across dimensions, distributions, and geometries support these conclusions and the mechanisms that make inexact ratios useful. **More broadly, the decomposition provides a theoretical basis for adapting likelihood-based LLM methods to flow matching, while distinguishing exact substitutions from controlled surrogates.**
This work derives the generalized score matching objective on a convex subset of $\mathbb{R}^{d}$ constructively starting from Minimum Probability Flow (MPF) learning, and shows how classical score matching as well as domain-adapted variants for non-negative data arise naturally within the proposed framework.
Nishanth Shetty, Saisuchith Mahajan, C. Seelamantula· 0 citations
This work shows that the regression difficulty of Conditional Flow Matching varies systematically along the path, and proposes Difficulty-Calibrated Flow Matching, which derives the schedule from the model itself: a short pilot run with the linear path records the per-time loss, and the schedule is set to the quantile...
Quantile AlignTree Flow Matching (QAT-FM), an efficient structured coupling strategy that constructs a hierarchical coupling between a Gaussian prior and the target data distribution via a quantile-aligned tree structure, is proposed, enabling scalable training for large-scale high-dimensional generative tasks.
Jun-Yi Lin, Meng-Yu Li, Jing-Xuan Hu et al.· 0 citations
This work proposes Missing-Data Flow Matching, which treats the missing coordinates of training samples as latent variables and averages the flow matching loss over the values they could take, and places the method alongside strong classical and deep imputation baselines on real tabular data.
Fairoz Nower Khan, Nabuat Zaman Nahim, Pei-Zhong Ju· arXiv.org· 0 citations
This work introduces structured dimension-matched variational transdimensional inference (SM-VTI) for finite enumerable model spaces and develops a rooted construction graph that expresses a model as a sequence of local stop/child decisions.
Low-Rank Prior-Induced Consistency Flow Matching (LOFT) is proposed for efficient and effective distribution modeling under highly sparse data, and introduces an uncertainty-aware rectification mechanism to enable efficient inference by linearizing generative trajectories.
Xiaowei Mao, Tingrui Wu, Yawen Yang et al.· Proceedings of the 32nd ACM...· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 13, 2026
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.
MIT News · Artificial Intelligence· news.mit.eduSep 29, 2026
Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.