- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes learning finite-time transport operators rather than infinitesimal transport fields for posterior sampling in dynamical systems. The authors introduce four variants to further discuss the idea.
Critical strengths
1.The finite-time transport perspective offers an interesting alternative to modeling infinitesimal flows. 2. The four variants systematically address different scenarios.
Critical weaknesses
1.While it is appreciated that the authors admitted about VarCM convergence and identifiability being open problems, the paper provides very little discussion of what happens if neither the variational objective J nor the transport operator g converge properly. If both components fail to converge, how can we trust that the final learned sampler produces valid posterior samples? This concern deserves more attention than a single sentence acknowledgment. 2.The font sizes in the main figures (especially Figure 2) are far too small to read. Axis labels and legends appear to be generated directly by plotting code without manual adjustment for publication. 3. Table 1 shows Pairwise CM has CRPS 6.8 times worse than Flow Matching on the GP task (0.109 vs 0.016), even though RMSE is similar. Since GP has an exact posterior, this suggests the method severely miscalibrates uncertainty. The paper does not analyze why consistency constraints fail to preserve posterior variance. 4. The paper builds on Consistency Trajectory Models but does not directly compare with CTM. Given that Pairwise CM appears to be a reformulation of CTM's pairwise consistency, it is hard to assess the actual improvement. 5. NFE versus accuracy curves are relegated to the appendix (line 922), but they directly support the main claim about computational efficiency. These should be in the main paper.
Questions for authors
1.Can you discuss what theoretical or empirical evidence suggests VarCM training converges to a valid posterior sampler? 2. Why does CRPS degrade so much in the GP experiment? Does the consistency constraint inherently distort the learned posterior variance, and if so, is this a fundamental limitation? 3. How does Pairwise CM compare directly to CTM on the same tasks? What is the actual novelty beyond reformulation? 4. The paper enforces semigroup consistency only on sampled triplets. Can you discuss whether this guarantees consistency for unsampled time combinations?
We thank the reviewer for the constructive review. All five weaknesses led to changes.
W1 / Q1. What if Jϕ or gθ do not converge? The revision makes this question checkable. (i) VarCM is now trained only through a strictly proper score (fair ensemble CRPS of fields and increments) of the ensemble it generates, with no L2 anchor: at its optimum, members follow the conditional law of these quantities. (ii) ∇Jϕ is a conditioning input of gθ, not the transport itself: a poorly learned prior makes the conditioning less informative, but the score still calibrates the output given that conditioning, and the observation term of Jϕ has no parameters. (iii) Convergence is monitored by quantities that do not require it: the checkpoint is selected on validation CRPS, and we report SSR, rank histograms and a composition test. On GP, whose posterior is known, VarCM reaches SSR 0.80 with a nearly flat rank histogram and the lowest RMSE (0.182 vs 0.198 for FM). The remaining open points are stated in the conclusion: calibration holds for marginals and increments, not for the full joint law, and DynVarCM is consistent in distribution, not sample by sample.
W2. Figure fonts. Fig. 2 was redrawn with readable fonts; the new figures (rank histograms, NFE study) use the same font sizes.
W3 / Q2. CRPS of CM vs FM on GP. Two causes, both fixed. The submitted CRPS values were not computed with the same normalisation for all models; all CRPS are now computed by one code, over all grid points. And the submitted CM targets built from a shared noise draw do shrink the variance (new Gaussian appendix: one-step std 0.0125 instead of 1). CM is now trained with targets from an ODE teacher, as CTM. Result on GP: CRPS 0.110 for CM vs 0.111 for FM, SSR 0.82 vs 0.70. Consistency itself does not distort the variance; the training targets did.
W4 / Q3. Comparison with CTM. In the revision, CM is a CTM-style model (two-time map, teacher ODE targets) conditioned on the observations, and we do not claim the pairwise primitive; CM is the CTM reference of our framework, with the same architecture and teacher as the other models. The novelty lies elsewhere: VarCM and DynVarCM learn the transport without teacher or reference trajectories, conditioned on a learned variational gradient and trained by a proper score; DynCM/DynVarCM put spin-up and physical time on one timeline, giving a smoothed trajectory with one evaluation per frame. On GP, DynVarCM improves on DynCM (CRPS 0.107 vs 0.127).
W5. NFE in the main text. Done (Fig. 4, Sec. 6.1), for all four models, with SSR and a composition test.
Q4. Consistency on unsampled time pairs. Training draws random pairs, so consistency is enforced in expectation, not for all triplets. We therefore test it on grids not used in training: the composition gap (samples of a grid vs the finest grid, same noises) decreases with the number of steps for CM, DynCM and VarCM. DynVarCM keeps its RMSE and SSR on refined grids, but its samples move by more than one spread: it is consistent in distribution only, which we state as a limitation.