- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper alternates block updates from short window generative models and shifts the block boundaries to propagate information from sparse observations along a long trajectory. It compares this approach with autoregressive and all at once sampling on several dynamical systems.
Critical strengths
The analytical Gaussian process experiment uses exact local conditionals and permits direct comparison with the true posterior. Its analyses of initialization and block shifts also examine burn in and sample mixing separately. This validates the central sampling mechanism more convincingly than final prediction errors alone would.
Critical weaknesses
The target posterior guarantee in “Block & Blanket” depends on neighboring states forming a sufficient Markov blanket for each block. Yet the appendix section “STOCHASTICITY” says that the turbulent flow is simulated on a finer grid and stored after coarsening, so that “the unresolved scales act as model error on the coarse dynamics.” Such a coarse process may retain temporal memory beyond the conditioning strip, while the experimental setup uses the narrowest strip because its temporal windows are short. The paper does not check whether a coarse state is conditionally independent of more distant states given this strip. Neither the exact posterior comparison on the analytical Gaussian process nor predictive scores on learned systems rule this out, so the turbulent flow improvement does not establish that the chain targets that system's true assimilation posterior.
The “Parallelism” section describes a cycle as sequential updates of alternating block sets and derives a cycle time independent of trajectory length given sufficient processors. Each block update still requires a full reverse diffusion, and the appendix “SAMPLING” configurations show repeated updates after initialization on the learned systems. “COMPUTE RESOURCES” reports training cost only, without inference latency, parallel resource use, or quality comparisons at equal compute budgets. The current results therefore show improved quality after extra cycles but do not establish its practical time and resource cost relative to autoregressive and all at once sampling. The abstract's claim of potential for operational assimilation consequently lacks an efficiency assessment.
Questions for authors
Could the authors test whether more distant history still informs a target block of the coarsened flow after conditioning on the current strip, and explain what this implies for the scope of the target posterior guarantee in that experiment?
Could the authors report inference time or computation against sample quality under the same hardware and stated parallel resources, comparing the complete procedure including initialization with the baselines at equal budgets?
2 comments
Thank you for your response. It addressed my concerns, and I have decided to increase the score.
Response to Reviewer 1Rog
We would first like to thank the reviewer for their relevant review and valuable feedback. We hope to address your concerns both in this response and in the revised manuscript (changes in blue).
W1 & Q1. Markov order approximation
Following your suggestion, we retrained a denoiser on Kolmogorov flow with a larger window size, W=7, to allow an ablation on the size of the conditioning strip. The new Table 12 (Appendix D.3, referenced l. 327–329) shows that a wider conditioning strip (C=2 instead of C=1) does not improve the quantitative ensemble metrics on Kolmogorov. Skill and CRPS are unchanged, and the only notable difference is a slightly better calibrated SSR for C=2. If more distant history still informed a block beyond the current strip, conditioning on an additional frame on each side would improve the reconstruction. Since it does not, this experiment indicates that the memory introduced by the coarse-graining is weak beyond one frame at this resolution, which validates the first-order Markov assumption, and thus the size of the Markov blanket used, as reasonable in practice. Regarding the scope of the guarantee, the manuscript now states that on Kolmogorov, GiBBS targets the posterior under this first-order Markov approximation of the coarse dynamics (l. 327–328).
W2 & Q2. Computational efficiency
All samplers are now evaluated on the same hardware, a single NVIDIA RTX A5000 GPU, and every table reports both the wall-clock time and the number of function evaluations (NFEs) of the complete procedure, initialization included (Tables 1, 3 and 4). The compute and time complexity of the three samplers is now analyzed in Section 2 (l. 122–137) and Table 2. To relate quality to cost, Figure 15 (Appendix D.2) reports the CRPS of GiBBS on Kuramoto-Sivashinsky as a function of the number of cycles, with AR and AAO as references. From a blind initialization, which comes at no cost, GiBBS matches AR after 8 cycles, that is 16 sequential reverse diffusions against the 36 of the AR rollout (l. 349–351).
That said, we do not claim that GiBBS is faster than other composition methods. The perspective we find most relevant is that of quality: a sampler that runs fast but does not target the right distribution returns quick but incorrect trajectories, which is of little use for data assimilation, where the posterior itself is what we seek. This is exactly where existing composition methods fall short. AR cannot anticipate observations it has not reached yet, so it drifts and is then pulled back onto them abruptly, while AAO hardly carries information away from the observation sites. On Ornstein-Uhlenbeck, where the exact posterior is available in closed form, neither of them reaches it (Figures 2B and 4B). GiBBS, on the other hand, targets the true posterior, and every additional cycle moves the chain closer to it, at the price of more compute. The number of cycles thus becomes a trade-off for practitioners, depending on how much they are willing to spend to obtain good posterior samples. Updating all blocks of a color in parallel keeps this cost reasonable, and for long trajectories (N>2I), GiBBS even needs fewer sequential denoiser calls than AR (l. 136–137).
We believe we have addressed your concerns and would be thankful if you could raise your score accordingly. We remain available for any further clarification.