- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
The paper solves the problem of discovering symbolic forms of PDEs from observational data. Existing search-based and regression-based methods (like SINDy) require defining a dictionary of terms to be searched over. The authors propose to instead discover symmetries (or use existing knowledge of them) to first construct a basis/dictionary to be used. This is all done on a linear level by finding the symmetry lie algebra, which is then derived into a set of differential invariants. The method is compared against SINDy and EquivSINDy-r and more.
Critical strengths
The theoretical basis of the method is well grounded, with classical results from Olver, and the dictionary of differential invariants can be used in many broad ways within discovery frameworks. The paper is easy to read, providing plenty concrete examples and extensive evaluations, particularly the additional experiments in the appendix.
Critical weaknesses
The proposed method only becomes helpful for problems where the symmetries are explicit, equations admit them, and there are sufficiently many of them. It is unclear how useful these are when applied to more real-world discovery problems.
The scope of the paper is quite limited: the problem of discovery of symmetries is not tackled here, and theoretical results are all classical results in the field of DE symmetries. It is a nice application, highlighting the usefulness for an ML community, and should be seen as a computational study primarily. However, a lot of interesting experiments and ablations appear in appendix only -- the authors should do a more thorough job of communicating the experimental evidence in main body.
Questions for authors
-
Why is Section 3 even a section? This appears to be at most a paragraph, if that.
-
Could authors expand on the logic in Appendix I.2 or remove it altogether? When the true PDE order is unknown, I am not convinced that the proposed approaches are generally justified. In particular, I do not believe that the order can be inferred from the highest order in the infinitesimal generators, as different-order PDEs can admit the same generators. E.g. Table 2 itself is a counterexample: KdV, KS and Burgers share exactly the same generators but have orders 3, 4 and 2. Similarly, high-frequency spectral decay does not generally determine the differential order without additional assumptions.
-
Another thing -- the paper multiple times mentions "losslessly", however taking even the reaction–diffusion example, the 5 invariants in Appendix H.3 look incomplete. With 14 variables and two rotations I’d expect about 12, and the set has no first-derivative terms at all, e.g. . Is the set meant to be complete? If not, the “lossless” claim doesn’t hold here.
-
The reported success rates and RMSE appear to consider only the learned coefficients , excluding coefficients fixed within the differential invariants. For example, in Appendix H.2, introduces a 50% error in the nonlinear coefficient of the Burgers equation, yet Table 5 reports 70% success and an RMSE of only . This still counts as a success with a tiny RMSE, while EquivSINDy-r’s RMSE does include that coefficient. Figure 5 actually shows DI-SINDy with the largest long-term error. Could you report the error of the full recovered equation, including the LHS coefficients? Otherwise Tables 3 and 5 don’t compare the same thing.
-
Line 306 -- should be Sivashinsky
-
Line 54 -- “Each symmetry corresponds to a conserved quantity” is only true for variational symmetries
Response to authors
Overall, although I appreciate the experiments the authors conducted, I do not think the responses fully address some of my main concerns despite some concerns are resolved.
I also agree with that observations are still needed when identifying the generating equation even if the symmetry prior constrains an equation family, but that doesn't counter my point: "having the right, good-quality symmetry of the underlying equation" is a strong prior that makes the method fall into a circular logic, in which we begin with knowing the symmetry (i.e. we know a faithful representation of the structure solution space of the equation we're discovering), and then use the symmetry to discover the equations to show that its performance is improved. The part about it that is circular is that knowing symmetry is a strong prior that has basically solved a big chunk of the equation discovery task you're doing, and, in the real & raw data regime (out in the wild), one cannot expect to know the symmetries of the underlying equation already (only in some physically interpretable sense, such as rotation, translation, scaling symmetries etc. - but they are only a very small subset of symmetries). The authors' way to tackle this is to use symmetry discovery method, but then how do you know the symmetry discovery method is gonna give you good symmetries? To be more concrete: LieNLSD uses a symbolic library - but what if LieNLSD's library is not expressive enough to produce faithful symmetries from data that you can use in the method of equation discovery the authors proposed?
The experiment of removing phase rotation thus does not resolve my concern because it only supports that "not knowing the complete symmetry group is okay" but does not support that "using low-quality symmetries can still help with discovery".
In response to the authors' response to W2(1)/Q1, if no useful symmetries are returned and that the proposed method degrades into an ordinary equation discovery, doesn't this serve as evidence to my W1 claim that the method heavily depends on the upstream symmetry discovery method returns a good (if any) set of symmetries? The authors' proposed method is on using symmetries on equation discovery, not on symmetry discovery itself. And, if on some data the SD method returns no symmetries and it's just vanilla equation discovery, then does that mean the proposed method fail in the case when the underlying data has no symmetries?
I appreciate the authors for conducting the differential order experiment in response to W2(2) and Q2. This fully resolves my concern regarding the differential order only. I also appreciate the experiment of different noise levels - it fully resolves my concern regarding differential noise only. I appreciate the authors for pointing out the E2E and PySR tasks, yet these are still symbolic equation discovery methods from benchmark PDE data and it doesn't establish compatibility with common neural pDE modeling approaches such as Fourier neural operators, neural surrogate models, or physics-informed neural networks, nor in a complex, measured engineering system. I think the scope of the plug-and-play claim is still only available in the explicit symbolic equation-discovery method regime but not in universal engineering applications and learning architectures - I do agree with that this is a limit of symbolic method itself instead of the paper's proposed method, but it still worths mention because the scope it's operating in determines its actual engineering impact.
I appreciate the high-dim PDE experiment. It resolves the concern on high-dimensionality only.
The concern on neural symmetry generators is not on its mathematical compatibility - it's on the numerical stability and implementation feasibility. I do not think the authors claim of the mathematical compatibility of the proposed method with neural symmetry generators is enough to resolve my concern because numerical issues might arise in implementation.
I appreciate for pointing out the LieGAN generators, which indeed resolves my question of how it would work with a different symmetry discovery method. However, it still doesn't resolve my main concern (as presented in the first comment of this response).