- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper argues that previous error bounds for flow matching samplers are too loose because they rely on a uniform Lipschitz norm in entire space. However, this raises the problem that this kind of estimation could also include regions that sampler never visit before.To answer this issue, the authors focus on Jacobian growth along the actual sampling trajectories and between the trajectories being compared. They showed that the final sampler's error depends not only on the velocity error, but also on how subsequent flow propagate. By considering for this error propagation and thus doing math, the author derives much tighter upper bounds on the "distance" between the generated and target distributions, which they validate through experiments.
Critical strengths
1: The paper is well-motivated: This paper addresses an important limitation of existing flow matching error bounds, and its motivation is quite easy to understand.
2: Strong theoretical contributions: This paper provides tighter error bounds without uniform Lipschitz assumptions and establishes sharp convergence rates from population loss.
3:Clear and convincing theoretical examples to support author's idea: The paper constructs examples showing that two models can have the same population loss and absolute Jacobian norms but result in very different final generation errors. This further support author's hypothesis.
Critical weaknesses
1: Authors only conduct the experiment only on the small-scaled and artificial experiments. However, I think these low-dimensional synthetic datas are not sufficient to demonstrate whether the proposed framework is effective for high-dimensional, real-world generative models. Even though it is theoretical paper, the author should at least try some small datasets, such as MINIST or CIFAR (if possible), in order to show this framework is valid more than toy examples.
2: The paper gives "Weighted population loss" (in the section 3). I think it is important invariance to further improve the upper bound for distributions (correct me if I am wrong). However, even though the author shows that weighted population loss improves theoretical guarantees, there is no result to test whether it improves actual generation performance.
Questions for authors
1: As I mentioned in the weakness part, could the authors evaluate whether the proposed framework remains effective on real-world image generation tasks, such as MNIST or CIFAR (CIFAR is even better), rather than only on low-dimensional synthetic datasets?
2: In Theorem 3, the upper and lower bounds involve the constants and , respectively. Could the authors provide any hint for numerical ranges for these constants in different dimensions? For example, when applying flow matching to high-dimensional datasets such as ImageNet (), could become extremely large as the dimension increases, making the upper bound too loose to be practically informative?
3: The standard flow matching objective minimizes the velocity prediction error. Although the proposed weighted population loss is mainly used for theoretical analysis in term of upper bound, it seems possible to incorporate a similar weighting scheme into the training objective:
I wonder whether this weighted training objective could improve the final generation quality compared with standard flow matching. Have the authors considered evaluating this experimentally?
If the author could solve these questions, I would consider raising my score.
Real-world datasets, constants, and weighted training
Thank you for your careful review and your constructive questions about real-world image generation, dimension-dependent constants, and whether weighted training improves generation quality. We respond to each point below.
W1 / Q1. Evaluation on real-world image generation tasks
We have added experiments on MNIST and CIFAR-10, the two datasets you suggested, in Sections 5.2–5.3. CIFAR-10 compares a trained reference model with three fixed weight modifications. Across 300 paired comparisons, signed estimates are 8.22–12.76 times endpoint RMSE (Table 2).
On MNIST, 144 measurements from 18 checkpoints compare path growth with estimated terminal Heun-map operator norms. The median log gaps correspond to factors of about 2.9 for signed growth and 586 for the operator-norm integral (Figure 5). Appendix I.1 gives the settings and precision checks.
Q2. Dimension dependence of the upper and lower constants
Yes, the sufficient upper constant can be extremely large. Appendix H.2 now gives its formula. For K=L=1, log10C is 8.61 at d=1, 1,843.43 at d=784, 7,635.26 at d=3072, and 576,048.31 at d=3×256×256. These values illustrate the scale of the proof constant.
The sharp rate describes how error depends on loss when dimension and growth constants are fixed. For an individual model, Theorem 2 retains its residual and the growth along the compared paths. For the lower bound, the proof establishes a positive constant independent of loss for fixed K≥K∗ and sufficiently small loss budgets. This establishes the matching dependence on loss. The numerical values above describe the explicit upper constant.
W2 / Q3. Does weighted training improve generation quality?
We trained standard CFM, state weighted CFM with a=2, and a time weight control on MNIST, using three paired seeds and 20,000 updates. State weighting lowers feature Fréchet distance in two pairs and raises it in one. The mean change is −2.52% relative to standard CFM, with a seed standard deviation of 6.61 percentage points. Relative to the time control, it is +0.75% ±1.17 percentage points. Weighted validation risk decreases in one of three pairs (Section 5.4 and Table 6).
With a known 32-dimensional reference velocity, weighted residual, endpoint RMSE, and tail RMSE decrease in all three paired runs, by 3.11%, 1.73%, and 3.83% on average (Appendix I.2). The theorem links an attained weighted loss to an error guarantee. The training experiments report the loss and sample quality actually reached.