- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper builds on Koopman theory to propose an efficient method for forecasting and estimating initial conditions from future observations. The key idea is to map the data to a latent space in which the dynamic is continuous and linear. This allows the latent state to be computed explicitly at any time by exponentiating , the matrix that governs the latent dynamics. The dynamics can therefore be integrated efficiently without sequential rollout. The Jacobian can also be computed efficiently (without a lot of matrix-matrix products), enabling the implementation of a 4D-Var-like data assimilation methods.
Critical strengths
- The paper is easy to follow, and the ideas are clearly presented, even for readers who are not familiar with the literature.
- The proposed method is highly efficient while maintaining satisfactory forecasting performance compared with other baselines. In particular, the linear dynamics in latent space allow to be computed at any time without autoregressive rollout, but simply by evaluating the exponential of . The same principle applies to the Jacobian, helping to mitigate gradient issues and numerical errors.
- The proposed method appears to remain stable over long integration horizons.
- Since the dynamic is continuous in latent space, the solution can be evaluated at any time , so not only at the timesteps seen during training. Figure 5c suggests that the method also produces accurate forecasts at previously unseen timesteps.
- The low-rank matrix provides an elegant way to incorporate physical parameters (e.g., the Reynolds number) into the dynamics. It also acts as a regularizer and allows the model to handle multiple physical regimes. This is an interesting practical capability that deserves greater emphasis in the main text.
Critical weaknesses
- Both forecasting and data assimilation are entirely deterministic. This is not necessarily a limitation for systems governed by known deterministic physical equations, such as those considered in the paper. However, the method may be less effective for complex systems such as the atmosphere (mentioned in the paper), for which deterministic predictions tend to oversmooth the range of possible outcomes. Similarly, the proposed data assimilation method appears to be an efficient implementation of 4D-Var in the latent space. It therefore provide only a point estimate of the solution rather than an ensemble representing the distribution of states compatible with the observations. In practice, observations are often sparse, and capturing the associated uncertainty and range of plausible solutions is important.
- My understanding is that the observations are sparse only in time, but not in space. This seems somewhat unrealistic, as real-world observations are often both spatially sparse and noisy. I would therefore appreciate clarification on whether I have correctly understood the experimental setup. If so, could the authors discuss whether the proposed method can handle spatially sparse and noisy observations, rather than assuming access to the full system state at selected time points.
- Is the matrix in Equation (11) directly learned during training? If so, I am concerned about the scalability of the method to high-resolution systems. As I understand it, Koopman methods require a latent space with a higher dimensionality than the original state space in order to obtain linear dynamics. For high-dimensional systems (like the atmosphere for example), this could lead to a very large latent space and, consequently, a prohibitively large matrix (whose memory cost scales quadratically with the latent dimension). I therefore wonder whether the authors also use a low-rank parameterization of this matrix in practice, and whether they have tested the method on larger systems. More generally, could the authors report in the main text the spatial resolutions of the systems considered in the experiments and the corresponding latent dimensions ?
Questions for authors
Could the authors clarify the points raised in the Weaknesses section (or explain why these concerns are incorrect) ? I'd be happy to increase my score if the authors provide convincing answers to my concerns.
Part 1
Thank you for a thorough and demanding review. We ran every comparison you requested and revised the claims where the evidence required it.
W1 + Q1 — Isolating continuous-time dynamics from latent optimisation. All three requested comparisons the full table, varying dynamics, control and first guess one at a time on identical trajectories (δf=9), are in our reply to WFaJ (W3).
So both the starting estimate and the variables we optimise affect accuracy, and not because fewer variables are optimised. The U-Net driven through the KAE decoder from the pull-back beats the KAE (0.009 vs 0.014) but takes 18× longer (1165 s vs 64 s). The learned representation and starting estimate help determine accuracy, while linear latent dynamics make the optimisation cheap. Under the tested settings the continuous linear model assimilates better than the discrete linear and nonlinear alternatives. Continuous time allows arbitrary observation times, although discrete linear KAEs also propagate efficiently. We now present the KAE as a favourable accuracy–cost balance, and the contribution statement says so.