mlsanityData to 7 Oct 2026

When Can Conditional Flow Matching Replace Pointwise Negative Log-Likelihood?

arXiv 2608.28010 ↗First posted 28 Aug 2026cs.LG cs.AIcited by 1

On the map: Diffusion models → Flow matching, time series and science

Abstract (arXiv)

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 (wsc(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.**

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in Flow matching, time series and science, one of 14 directions in Diffusion models. Builds on 27 of its 28 references that are in the map. First posted on arXiv 28 Aug 2026.

Builds on

27 of 28 references.

Closest ancestors · 3

Same direction, newest first

  1. 2026Improving Flow Matching by Aligning Flow Divergence31 Jan
  2. 2022Flow Matching for Generative Modeling6 Oct
  3. 2022Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flow7 Sep

Other references · 24

  1. 2017Proximal Policy Optimization Algorithmscited by 14,441
  2. 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 8,964
  3. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
  4. 2023Direct Preference Optimization: Your Language Model is Secretly a Reward Modelcited by 7,916
  5. 2018Neural Ordinary Differential Equationscited by 3,733
  6. 2022Building Normalizing Flows with Stochastic Interpolantscited by 964
  7. 2023Training Diffusion Models with Reinforcement Learningcited by 939
  8. 2023Diffusion Model Alignment Using Direct Preference Optimizationcited by 767
  9. 2021Maximum Likelihood Training of Score-Based Diffusion Modelscited by 670
  10. 2025Flow-GRPO: Training Flow Matching Models via Online RLcited by 605
  11. 2023Understanding Diffusion Objectives as the ELBO with Simple Data Augmentationcited by 293
  12. 2025Improving Video Generation with Human Feedbackcited by 267
12 more
  1. 2025DiffusionNFT: Online Diffusion Reinforcement with Forward Processcited by 204
  2. 2025MixGRPO: Unlocking Flow-based GRPO Efficiency with Mixed ODE-SDEcited by 168
  3. 2025TempFlow-GRPO: When Timing Matters for GRPO in Flow Modelscited by 93
  4. 2025Flow Matching Policy Gradientscited by 86
  5. 2022Maximum Likelihood Training for Score-Based Diffusion ODEs by High-Order Denoising Score Matchingcited by 79
  6. 2025Advantage Weighted Matching: Aligning RL with Pretraining in Diffusion Modelscited by 59
  7. 2022Matching Normalizing Flows and Probability Paths on Manifoldscited by 57
  8. 2023Improved Techniques for Maximum Likelihood Estimation for Diffusion ODEscited by 54
  9. 2025Unified Continuous Generative Modelscited by 19
  10. 2026Rethinking the Design Space of Reinforcement Learning for Diffusion Models: On the Importance of Likelihood Estimation Beyond Loss Designcited by 17
  11. 2026Reinforce Adjoint Matching: Scaling RL Post-Training of Diffusion and Flow-Matching Modelscited by 17
  12. 2026V-GRPO: Online Reinforcement Learning for Denoising Generative Models Is Easier than You Thinkcited by 7

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2025Weighted Conditional Flow Matching
  2. 2026Exploring and Exploiting Stability in Latent Flow Matching
  3. 2026What Does a Stream Model Buy You in Flow Matching?
  4. 2026Difficulty-Calibrated Interpolation Paths for Conditional Flow Matching
  5. 2025Score-Regularized Joint Sampling with Importance Weights for Flow Matching
  6. 2024Stream-level flow matching with Gaussian processes
  7. 2025On The Hidden Biases of Flow Matching Samplers
  8. 2026Counterfactual Generation via Flow Matching: Coupling-Sensitive End-to-End Rates