- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes an innovative evolution operator learning method for nonlinear time dependent partial differential equations (PDEs) of the semi-linear type. The neural operator architecture is deceptively simple, based on a first order approximation to the Duhamel principle (linear part and a local nonlinear part). When the true dynamics is not semilinear, the authors propose a local encoding and decoding to map into a latent space where the dynamics is (hopefully) approximately semi-linear. The training can be performed purely from trajectory data of the PDE. On the theory side, the authors prove two interesting theorems. The first shows that the difference in the action of the model at two distinct time steps controls the difference on a whole interval of times. The second result is an injectivity result again based on two step sizes (with a negative result if only one step is considered). Numerical experiments show better (and sometimes much better) accuracy than baseline methods for learned evolution operators.
Critical strengths
I like the first-order Duhamel parametrization idea. It explicitly exposes the role of the time step in the architecture, rather than inserting \tau as another neural network input in a black box way. The paper is quite readable and easily to follow up until Section 2.3
The method has extremely good performance (see Table 3) on some problems, and good but less impressive performance on others. Regardless, the simplicity of the network parametrization should be praised; it gives better performance than much more complicated alternative methods (such as those described in Section 2.4).
Theorem 1 is quite interesting and important for the field of equation learning.
Critical weaknesses
Can Assumption Eqn 13 be verified for specific PDEs of interest, such as those studied in the numerical experiments part? I would like to see more discussion about when the hypotheses of the theorems are satisfied, in order to make sure they are not vacuous empty sets.
I have a hard time understanding the proofs, which are not easy to read. This is not critical, but I am not sure where else to write this.
Questions for authors
What is meant by "persistence" as the last word at the very bottom of page 5?
Table 5: All learned coefficients are of the same order, which seems to contradict the claim in Line 477. Does this suggest that the data could be explained by a different PDE with additional terms defining the differential operator rather than just the Laplacian?
Figure 1: What can explain the oversmoothing as time advances in the bottom row of Figure 1? This is undesirable.
2 comments
I thank the authors for addressing my comments.
Response to Reviewer GTwC
We thank the reviewer for the constructive comments. We have added concrete KdV, Swift–Hohenberg and advection–diffusion examples verifying the nonlinear separation assumption. We have provided outlines for the two main proofs and clarified the definition of persistence. We have also expanded the PDE reconstruction analysis to account for both model components and added SEVIR comparisons with a discussion of the oversmoothing. We respond to each point below.
Weaknesses
W1. Verifying Assumption (13).
(Submission: Eq. (13); revision: Eq. (12).)
Yes. The nonlinear separation condition (Eq. (12) of the revision) holds for the reference models of all three synthetic examples: the quadratic transport nonlinearities of KdV and advection–diffusion, and the polynomial reaction term of Swift–Hohenberg. Each satisfies it with an explicit positive separation constant; Appendix A.1.2 gives the proofs and the parameter conditions. So the assumption is satisfied by the PDEs in our experiments.
W2. Readability of the proofs.
We have added a short outline before each of the two main proofs, cross-step stability and identifiability (Appendices A.1.1 and A.2.1), stating the main steps and the lemmas they use.
Questions
Q1. "Persistence" on page 5.
(Submission: page 5; revision: page 6 (Section 2.4).)
Persistence is the baseline that uses the last observed field as the prediction at every future time, u(t0+t)≈u(t0). We have defined it at its first mention in Section 2.4.
Q2. Learned coefficients in Table 5.
(Submission: Table 5, Line 477; revision: Table E.2 (Appendix E); Appendices D.1 and D.5.)
We agree that our original comparison, based only on the coefficients of g, was incomplete for assessing PDE recovery. The learned vector field is Au+f(Φ[u]), and f can contain linear differential terms as well as nonlinear terms. Therefore, first-order coefficients in g alone do not establish that the full model represents a different PDE with additional physical transport terms.
We have updated the AD coefficient table (Table E.2, Appendix E) to report, in the same basis, the reference coefficients, the contributions of g and f, their sum (the effective coefficients) and E-WSINDy. Appendices D.1 and D.5 describe the procedure: we fit the output of the learned f on a library of linear and nonlinear differential monomials and add each fitted linear coefficient to the matching coefficient of g.
The first-order coefficients of g (−0.22 and −0.29) are almost exactly cancelled by f, giving effective values of −0.00005 and 0.0014. The effective diffusion coefficients (0.049 for both directions) and the transport coefficients (−0.99 and −1.01) are close to the reference values 0.05 and −1. The apparent first-order terms in g are therefore a redistribution between the two components, not additional terms of the learned PDE. The fit residuals and vector-field errors are reported in Appendix D.5.
Q3. Oversmoothing in Figure 1.
(Submission: Figure 1; revision: Figure 3 and Appendix C.4, Figure C.4.)
As the reviewer correctly noticed, the predictions become smoother as time advances. This oversmoothing is a common issue in deterministic precipitation nowcasting, particularly at longer lead times (Ravuri et al., 2021). With squared-error training, the population-optimal prediction is the conditional mean, so averaging possible cell locations and intensities can smooth local features. Autoregressive prediction can carry these errors forward.
To compare with other methods, we have added the full 5–50 minute sequence with KNO and OSG-FNO alongside ENNO in Appendix C.4 (Figure C.4). ENNO preserves the broad storm structure, while small-scale details and localized intensity peaks weaken at longer lead times. KNO and OSG-FNO also lose fine-scale target structure, and KNO shows additional contour deformation.