- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The paper examined an interesting question of how to eliminate structural uncertainty when considering PDEs: such issues are problematic as it's unrelated from amount of data or model decisions, and would have to be factored out via training procedures. The authors showed a procedure for linear problems where they were able to evaluate the amount of uncertainty in a given problem, decide on constraints to eliminate them, then train; they then demonstrated on two problems in the main text with some extensions in the appendices.
Critical strengths
- Rigorous approach to the problem of how to design a loss function to remove ambiguity from the data. I've never thought too much of this issue in the past, but I think the paper has convinced me that this might be an issue in the future, and might be something to use with different structural preserving NNs. Their approach seems to attack the correct part of the inverse problem which is not discussed in the field.
Critical weaknesses
-
Originality and scope: while I'm not an expert in inverse problems, I'm very surprised that the field doesn't have similar results proven already as the result is straightforward linear algebra? One would expect that classical uniqueness results would also examine sampled points in the interior too, as those are very relevant scientific problems. I think the main contribution would be the recipe + tangent stuff which brings me to...
-
Clarity in writing: I had a hard time reading this. For example, Thm 1 is far too long, and one should place the definitions outside the theorem block with potential examples to guide the reader. I do not understand lines 324 to Section 5; which of the step is it trying to solve? These paragraphs seems to me to be the most exciting part of the paper, but it's much too compressed and needs to be expanded drastically. Furthermore, too much details are swept to the appendix that it forces the reader to read it for the experiments.
Questions for authors
-
See point 1 of weakness regarding originality and scope. Perhaps a wider lit survey is needed.
-
One major question: is this a bad thing? Using the helio/geocentric example at the beginning, it seems that if we were just trying to predict planetary movement that as long as the ML system were to predict correctly, it really doesn't matter which reference frame was used.
-
How would this work with something like SINDy or general equation discovery in analytical forms? Wouldn't that be a major win to be able to, say given the planetary data, give you the classical Kepler's law?
-
I understand for sake of analysis that the limitation to nonlinear dependence makes sense, but isn't this fairly non-restrictive? In PDE land, I feel that most equations are linear in the coefficient feature vectors? Can you exposit more on this?
Response to Reviewer ch7A
Thank you very much for your encouraging review. As explained in our general response, I apologize for the delay in our response. We are glad that the paper conveyed why this issue may matter for structure-preserving networks. We apologize that our literature survey was insufficient and that parts of the paper were hard to read. Your suggestion to widen the literature survey helped us state the novelty of our work more concretely, and your question on whether structural non-uniqueness is actually harmful led us to add experiments that extract physical quantities from the learned models, which show the effectiveness of the framework much more directly. We are sincerely grateful for both.
Originality (W1, Q0). You are right that the result is straightforward linear algebra, and we apologize that the shortened manuscript overstated the novelty of the theorem. We now relate Theorem 1 explicitly to classical identifiability analysis and to uniqueness results for interior data and for learning PDEs, notably He, Zhao & Zhong (2024) and Scholl et al. Our contribution is the framework: the position that structural non-uniqueness must be evaluated before a coefficient function learned with PIML is interpreted as physics, and a routine procedure for doing so across a broad class of PDEs. The procedure is deliberately elementary so that physical scientists who are not specialists in inverse problems can apply it as a standard check. Revision: Abstract; Sections 1 and 2.3; Section 3 ("Relation to classical results").
Clarity (W2). Thank you for the concrete suggestions. We now write the class of PDEs explicitly (Eq. (3)) with examples (Hamilton's equations, the wave-kinetic equation, the diffusion equation). We moved the definitions out of Theorem 1, which now states only the equivalence, and added a paragraph explaining with the wave-kinetic example why compatibility matters. Lines 324–377 are Step 3, which gives a hint for the weight λ of the soft constraint of Step 2. We now open Step 3 with its idea in plain terms: the structurally undetermined directions are those along which the physics loss is flat; adding the constraint should remove this flatness; and we take as a hint the λ beyond which increasing it brings diminishing reduction. Concretely:
The main comparison of rules for choosing λ is now in the main text (Fig. 5). Revision: Section 3; Section 4 (Step 3); Fig. 5.
Q1. Is this a bad thing? For predicting the observed quantity it is harmless, which is exactly why the predictive loss cannot detect it. It matters once the learned function is used as physics. In the pendulum example, the unconstrained model reproduces the training relation with small error, yet its effective mass ∂²L/∂θ̇² is negative in 80% of held-out states and the equation of motion derived from it is wrong (median error 5.3 against accelerations of order one). With the constraint, the mass is recovered as 1 and the equation of motion to within 0.01. In the wave-kinetic case, ∂H/∂k_x is a group velocity: H and H + F(I) give the same evolution of I but different velocities. Revision: Section 5.1; Table 10.
Q2. SINDy and equation discovery. The analysis applies upstream of equation discovery. If the library columns are linearly dependent on the data, sparse regression can return any member of the equivalent family, and the null-space analysis shows which constraint or observation resolves it. Once the function is identifiable, symbolic regression can be applied to seek a closed form, in the spirit of your Kepler example. Revision: Section 6.
Q3. Linearity. We agree. The equation needs to be linear only in the values and derivatives of the unknown coefficient function; dependence on the state may be arbitrarily nonlinear. We now write this class explicitly as Eq. (3). It covers Hamiltonian and Lagrangian mechanics, Liouville- and wave-kinetic-type transport equations, Burgers-type equations, and diffusion and advection–diffusion equations with unknown coefficients. Revision: Section 1; Section 3 (Eq. (3)).