- Rating
- 2
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper introduces Flux Matching, a loss for learning nonconservative vector fields whose stochastic dynamics have the data distribution as their stationary distribution. In this fixed-distribution setting, experiments on toy Gaussian mixtures and RNA velocity explore controllable and interpretable dynamics.
The authors then extend the objective to noise-conditioned fields across perturbed data distributions, providing an alternative to denoising score matching for diffusion-style generation. This extension is evaluated through image generation and sampling acceleration on CIFAR-10 and CelebA, and through causal attention constraints for generating simulated trajectories.
Critical strengths
S1) The paper develops an approach to learning distribution-preserving dynamics beyond the score that is well-founded. The projected Fisher formulation provides a theoretical basis for allowing constraints to shape the learned vector field. This flexibility is a promising contribution, even though its practical benefits require stronger validation.
S2) The core idea is presented clearly, particularly the distinction between matching the score and matching the divergence of probability flux. This makes the proposed formulation and its relationship to score-based modeling easy to follow.
Critical weaknesses
W1) Theoretical. The motivation and positioning of the generalization need further development. Nonconservative dynamics preserving a target distribution are established in prior work [1]. Although the authors mention this literature and connections to transport-based generation in Appendices F and E, these relationships are central to assessing the contribution and should frame the main discussion. Appendix G leaves the identification of useful objectives and constraints to future work, while the current demonstrations do not convincingly establish benefits that justify the additional complexity and computational cost.
W2) Empirical. The image-scale sampling claims lack essential comparisons and convincing evaluation. Since the image experiments use noise-conditioned fields, Flow Matching [2] is an essential baseline for claims of efficient sampling. Energy Matching [3] additionally removes noise conditioning and targets the stationary distribution at image scale, including the same CIFAR-10 task. The reported gap, approximately FID 3–4 for these approaches versus 9 for Flux Matching, is substantial and requires explanation through direct comparison. Figure 6 relies on 1K-sample FID without uncertainty estimates and omits these relevant baselines, providing little support for the claimed sampling advantage.
References:
[1] Ma et al. A Complete Recipe for Stochastic Gradient MCMC. NeurIPS, 2015.
[2] Lipman et al. Flow Matching for Generative Modeling. ICLR, 2023.
[3] Balcerak et al. Energy Matching: Unifying Flow Matching and Energy-Based Models for Generative Modeling. NeurIPS, 2025.
Questions for authors
Q1) Can you isolate the RNA-velocity gains from the transcription-model change introduced in Eq. (41)?
Q2) Have you tested fixed-target image sampling without noise annealing?
Q3) Can you compare against/discuss Flow Matching [2] and Energy Matching [3] on CIFAR-10? The paper’s sampling-efficiency claims should be evaluated against transport-based approaches - this is the most important question for my assessment. Or alternatives if applicable (e.g. OT-CFM [4] and Equilibrium Matching [5] or more -- there are many papers that came after DSM that are relevant)
Q4) Figure 6 shows better FID with fewer predictor–corrector steps, but this could reflect better handling of large numerical steps or transitions between noise levels. What evidence attributes these gains to faster mixing toward a fixed stationary distribution?
[4] Tong et al. Improving and Generalizing Flow-Based Generative Models with Minibatch Optimal Transport. TMLR, 2024.
[5] Wang et al. Equilibrium Matching: Generative Modeling with Implicit Energy-Based Models. NeurIPS, 2026.