- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
ChronoSync targets long-horizon prediction of coupled multiphysics PDEs when training data come only from decoupled simulations, where each field is solved with the other fields prescribed. One conditional Elucidated Rolling Diffusion Model (ERDM) is trained per field. At inference, inside each Heun step the field models are swept in order, each conditioned on the latest under-relaxed () estimate of the other fields, and the rolling window is advanced in PDE time with one bootstrap refinement. The paper characterizes the splitting error through Lie brackets and a rollout recurrence. On FitzHugh–Nagumo, Burgers, Darcy transport and Rayleigh–Bénard, ChronoSync cuts error by 53–74% relative to the best decoupled baseline on the three harder systems, recovers about 90% of the conditional-to-oracle gap, and tracks solute centre of mass and the Nusselt number.
Critical strengths
- The gains over decoupled baselines are large and consistent on the harder systems (Rayleigh–Bénard velocity 0.663 → 0.217, Darcy q 0.141 → 0.036 vs GenCP-AR), and on Darcy they hold at every window length tested (Fig. 22). The rolling design also avoids the memory blow-up of full-trajectory M2PDE. Composing separately trained field models over long horizons is a useful problem.
- The evaluation goes beyond field error: Darcy solute centre of mass, Rayleigh–Bénard Nusselt number, and extrapolation from 300 to 399 frames, where ChronoSync stays close to FNO-AR-Joint.
Critical weaknesses
- The gains are not attributed to the synchronization itself, and the existing ablations do not support the extra components. The baselines use different backbones and samplers, and there is no same-ERDM control (window-level alternation, Jacobi update). Where and bootstrap are ablated (FHN and Burgers only), they do not help: matches or beats the default 0.25 (Figs. 16, 19), and on Burgers no bootstrap beats ( vs 0.025, Fig. 21), yet both are used in all experiments. The comparison with the coupled oracles also depends on the window. Darcy uses , which is ChronoSync's best window and the oracles' worst; at , ERDM-Joint reaches against ChronoSync's best 0.075 (Fig. 22). The "90% of the gap recovered" figure inherits this choice.
- The theory does not cover the implemented algorithm. Eq. (3) sums local Lie-bracket defects without propagating them through later denoising steps, the rollout recurrence drops the terms, and the mixed-regime contraction in Corollary 1 is assumed but never measured. The analysis is for plain Lie–Trotter, not the relaxed sweep with bootstrap used in the experiments. It explains the idea but does not support the long-horizon stability claim.
Questions for authors
- Can you add same-backbone ablations (ERDM with window-level alternation, Jacobi update, ), /bootstrap sensitivity on Darcy and Rayleigh–Bénard, and inference cost (NFE, wall-clock) against the baselines?
- Can you report Table 1 and the gap-recovered numbers with each method at its own best window length? Can you also report estimates of or of the Lie-bracket terms along real rollouts?
- In the released code (FHN/Burgers only), "lie" mode conditions the second field on the first field's unrelaxed output, while Algorithm 1 uses the relaxed estimate. Which one produced Table 1? Also, the conditional data use one pre-iteration, which already carries some coupling information, and for Rayleigh–Bénard it costs more than the coupled simulation (Table 7). Which practical setting is this method meant for?
5 comments
Response to Reviewer rgmW (continued)
W2 / Q2. Theory and the implemented algorithm; estimates of
- Propagation of local defects (equations 2–3, Appendix C.1.2). The splitting analysis now covers the Heun type Lie–Trotter scheme that ChronoSync runs. Local approximation errors are propagated through the newly introduced Heun-type analysis scheme (Equations 2, 3, 34–35). Lemma 1 discusses bounds for the global error from per-rollout defect through , so they enter the rollout bound (equation 57) as an explicit term rather than being dropped.
- Measured products, replacing the assumed contraction (new Section 5, Table 2, Figure 4). We inject the measured splitting defect into real rollouts and track the committed-frame response. This response is a proxy for . Both systems are in the mixed regime of Corollary 1:
- Darcy contracts at – per rollout.
- RBC amplifies at – while convection develops, then contracts at – after .
- The terms. Dropping these is the standard linearized stability step for non-autonomous discrete-time systems (Potzsche, 2010). The measurement in Section 5 is made in this linear regime.
- Relaxed sweep and bootstrap (new Remark 1). The analysis covers . With one bootstrap pass, the rollout map is a composition of two coupled Heun passes, so Theorem 2 applies unchanged. The relaxation is empirically within 6.7% of (see above).
Q3. Released code vs. Algorithm 1, pre-iteration, and the target setting
- Code vs. Algorithm 1. Thank you for checking the code. The code is the reference implementation and produced all reported results, including Table 1. Each field is conditioned on its partner's freshest, unrelaxed estimate, and the -relaxation is applied once after the sweep. Algorithms 1 and 3 and the text of Section 3.4 and Appendix B are now corrected to match the code. The two orderings coincide at , so the theoretical analysis is unaffected.
- Pre-iteration.
- FitzHugh–Nagumo and Burgers use no pre-iteration. Each field is solved against a partner sampled independently from a Gaussian random field (Appendix E.1–E.2), and ChronoSync recovers 96.5–99.7% of the gap there.
- For Darcy and RBC, a single pre-iteration keeps the prescribed fields physically admissible. The resulting conditional data remain far from the coupled dynamics. RBC conditional errors are 0.219 () and 0.977 () in Table 1, and they diverge over time in Figure 2. Same is the case for Darcy too.
- Target setting. We agree that on RBC the two conditional solves together cost more than one coupled solve (Table 8). Our target is the setting where coupled solves are unavailable and when conditional solves are grossly inaccurate (as in our setting; Figure 2). Separate single physics codes, legacy solvers that cannot be coupled, or observations of one field given the others. For Darcy, the conditional solves are also cheaper (46 s vs. 130 s).
We hope these additions address the reviewer's concerns, and we would be glad to clarify anything further.
Thank you for the additional experiments and clarifications. The same-backbone ablation, bootstrap tests, and window-length analysis substantially address my empirical concerns. The stability measurements are also useful, although the theoretical coverage of the relaxed implementation remains limited. These additions strengthen my support for the paper, and I will maintain my weak-accept rating.
Response to Reviewer rgmW
We thank the reviewer for the careful reading of our paper and for providing valuable feedback. All references below are to the revised PDF, where changes are marked in blue.
W1 / Q1. Same-backbone ablations, kappa/bootstrap sensitivity, and inference cost
Window-level alternation (new Table 18, Appendix K.5). We keep the conditional ERDMs, rolling procedure, 5 Heun steps and number of network evaluations per committed frame fixed. Only the cross-field exchange frequency changes.
Exchanging once per window raises the error on every field. The increase is largest on Rayleigh–B'enard (RBC), where the coupling is strongest and the window is longest. Five Heun steps match the 32 step accuracy of Table 1 (Table 17), so this comparison applies directly to the main results.
κ and bootstrap on Darcy and RBC (new Figures 24, 25, 27, 28).
Inference cost (new Appendix I, Table 14). RBC, W=55, batch of 5 trajectories, 55 committed frames, one GPU. NFE is the total number of network evaluations for the run.
How the NFE counts arise:
With 5 Heun steps, ChronoSync is 7 times faster than with 32 steps, at comparable accuracy (Tables 14, 17).
W1 / Q2. Window length and gap recovered at each method's best window
On Darcy, ChronoSync prefers short windows and the oracles prefer long ones (Figure 23). On RBC, every method improves with W (Figure 26). Table 1 uses the same window per case study for all methods for consistency. Whereas, window ablations are now provided for all the case studies.
Gap recovered at each method's best window. The gap recovered is (econd−eCS)/(econd−eFNO). The conditional error does not depend on W, so the gap changes only through ChronoSync's best window (numerator) and FNO-AR-Joint's best window (denominator). Taking each at its own best window (except for FHN and Burgers because FNO-AR-Joint is already doing very well):
The Darcy gaps fall because FNO-AR-Joint improves at long windows. The RBC gaps rise because ChronoSync improves at long windows. For FitzHugh–Nagumo and Burgers, we keep the Table 1 values (96.5–99.7%), where the gaps are already close to 100%. The headline of about 90% therefore does not depend on the window choice.