- Rating
- 2
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The proposed paper fit an isotropic gaussian mixture to the data and couples data points to mixture components through posteriors. A time-transformation and guidance correction relates the resulting flow to a gaussian source, allowing reuse of a frozen pretrained backbone. The practical correction combines an analytical GMM term with a small learned residual. Experiments on a checkerboard example, CIFAR-10, and CelebA-HQ demonstrate improved FID across the reported Euler budgets.
Critical strengths
- Proposition 5 provides an explicit GMM correction that makes a structured source usable with an existing Gaussian-source checkpoint. That is a strong technical contribution, as it enables a practical correction while keeping the backbone frozen.
- The trained variant improves every reported Euler FID point on both datasets. The checkerboard ablation help explain the mechanism, and the analytical variant provides substantial gains at low step counts after fitting the mixture.
Critical weaknesses
-
The specific advance over existing guidance matching is not fully clear. On the Guidance of Flow Matching (ICML 2025), is a closely related omitted reference. Their Appendix A.4 gives the same ((1-t)/t) guidance coefficient. Under the paper’s component-marginal condition, their MRGM loss, Eq. (45), yields Eq. (21) after averaging over components. The new contribution therefore lies in the GMM-specific decomposition and parameterization, which is not new.
-
Appendix B.3, invokes Proposition 3 for the results, although that proposition assumes the exact conditional field. Equations (19)–(20) replace by and omit the remaining correction. Even with an exact base velocity,
Questions for authors
-
Contribution of the analytical term: With the same frozen backbone, GMM responsibilities, correction-head architecture, how does Eq. (19) compare with learning the entire additive correction without its analytical term?
-
Also, Please report FID and sampling time, and also clarify the relationship to MRGM's objective.
-
Remaining approximation error: On the checkerboard example, what endpoint distribution error remains for the untrained and trained variants when the solver is run to numerical convergence? Can authors distinguish field approximation from discretization error?
-
Reliability and scope of the speedup: Please report uncertainty and end-to-end timing for the CelebA-HQ comparisons of 64 versus 128 steps.
-
Can authors please Include the GMM-fitting cost alongside the correction-network parameter count.
-
The 1,000-sample nearest-neighbor analysis in Section 5.4 supports no detected increase in near-copy behavior. It does not establish a general absence of memorization. I am interested to see how authors defend their claim/s here.
-
The statement on p. 2 that classifier guidance necessarily at least doubles per-step cost is too strong. Its overhead depends on the classifier architecture and input-gradient computation.
3 comments
Dear Authors,
Thank you for the response and the additional experiments. Some of my earlier concerns (in Questions and Weakness section) have been addressed, and I appreciate the authors' efforts. However, I am still not satisfied with the authors' response to W1 about the novel contributions beyond the related work. Therefore, I would like to keep my original rating for now.
We thank you for your reply. Could you tell us what remains unsatisfactory in our answer to W1, so that we can address it before the end of the discussion?
To restate it briefly, the only element we share with Feng et al. is Eq. (12) of the revised PDF. It is classifier guidance, as in Song et al. (2021) and Dhariwal and Nichol (2021), written for flow matching in Eq. (4.90) of Lipman et al. (2024), which predates Feng et al. The paper derives it in two lines in Appendix A.2, the revision cites these works next to it, and we do not claim it.
Everything else differs. We change the source and the coupling, which is the mixture posterior and the optimal entropic coupling (Propositions 1, 2 and 4), and the target stays (Proposition 3), whereas Feng et al. keep the Gaussian source and reweight the target. Our guidance needs no Monte Carlo estimate and no learned normalizer, since it is closed form up to one scalar function (Proposition 5), and it beats the baseline without any training (Table 3). Its energy comes from the fitted mixture and needs no labels.
We thank you for the careful review. The changes to the paper are in red in the revised PDF, whose equation and table numbers we use here (a new Eq. (11) and a new Table 1 shift the later numbers by one).
Relation to prior guidance work. We now cite Feng et al. (2025). In their framework, each slice p1(k) is p1 reweighted by e−J(x1)=Γ(k∣x1), Eq. (12) is their guidance field and Eq. (22) is their MRGM loss averaged over components. For our coupling the guidance is exact, a case they treat only approximately (their Section 3.1), and closed form up to one scalar function (Eq. 19), with an energy that comes from the fitted mixture and needs no labels. We use it to improve unconditional generation, not to steer the target.
Appendix B.3 and Proposition 3. You are right, Proposition 3 assumes the exact conditional field, and the untrained model replaces qt by qtref and drops the second term of Eq. (19). We updated the paper accordingly.
Contribution of the analytical term, FID and sampling time. We trained the same head without the analytical term, with mk and qtref still as inputs. Its sampling time is that of the trained model, 3 percent above the baseline on CIFAR-10 and 5 percent on CelebA-HQ. Its FID is
On CIFAR-10 this variant is slightly better from 4 steps on, but on CelebA-HQ it is worse at every step count, and at 256 steps even worse than the Gaussian baseline (10.01). We think that, due to the higher dimension, the analytical term finds the correct posterior more quickly on CelebA-HQ. We report this variant in Appendix B.3 of the revision.
Approximation error on the checkerboard. Sliced 2-Wasserstein distance between 250k endpoints of the four models of Figure 1 and the checkerboard density, with Euler at the step counts of Figure 1 and RK4 at 1024 and 2048 steps.
The two RK4 columns agree to four decimals, so they measure the exact flow of each field, and the rest of each row is discretization error. The coupled models learn a better density, their exact flow ends closer to the target, and they reach their own limit in far fewer steps. Two independent exact samples are at distance 0.017, a floor that no model can beat. We added this to Section 5.1 of the revision.
Reliability and timing of the speedup. FID over three sets of 10k samples (mean and standard deviation) and time per sampling step on a V100 with a batch of 16 images.
The trained coupled model reaches the quality of the baseline with half the steps, in 52.5 percent of the time.
Cost of the mixture fit. On one V100, fitting the mixture takes 16 minutes on CIFAR-10 (K=4096) and 76 minutes on CelebA-HQ (K=1024), and training the correction network 1.4 and 17 hours. Timing one training iteration of each base network on the same GPU and multiplying by its released iteration count gives 207 and 4540 hours for the base networks, so our additions cost under 1 percent of their training. We added this comparison to Section 5.2 of the revision.
Memorization. We agree that claiming no memorization is too strong. We now only claim that our model does not memorize more than the Gaussian baseline, in Section 5.4 and in the conclusion. We also repeated the experiment with 10000 samples per model on both datasets for more statistical significance, and updated Table 4 and the figures accordingly. With 10000 samples, the coupled model remains slightly farther from the training set than the baseline on CIFAR-10 and as far on CelebA-HQ. Moreover, the baseline produces five near copies of a car that appears several times in the CIFAR-10 training set, and the coupled model produces none.
Cost of classifier guidance. You are right, we updated the paper accordingly.