- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper focuses on Neural Operators and combining different PDE differential operators. Given PDEs that are defined through a single transport, diffusion, or generic differential term, the objective is to learn a model that, trained on these individual instances, can combine the mechanisms defining their dynamics, leading to a model that is capable of solving the PDE with all terms active. The key idea is to consider a generator operator for each term and combine them via an appropriate algebra. The results show that the model is indeed capable of combining differntial terms to unseen combinations.
Critical strengths
- The problem is relevant and interesting, with few approaches that have attempted to solve it. The problem definition is also sound, with good motivation, and the results achieved are great.
- The proposed solution seems sound: trajectories generated from individual mechanisms cannot be trivially combined, and it is thus necessary to combine the mechanisms with a meta approach.
Critical weaknesses
The paper has several issues, from the presentation of the methodology to the experiments:
- The related works section lacks too many details and feels more like a list than a coherent comparison of models. In particular, works such as [1] and [2] and [3], which constitute some of the main competitors, are only sketched.
- Furthermore, these related works try to solve the same problem as the paper, that is, combining seen physical mechanisms on unseen combinations or, more generally, combining physical operators. However, there are no experimental results concerning these models. The models HGN is compared to, such as U-Net and FNO, are all designed to solve a single specific problem and do not naturally extend to unseen physics. It is also not clear how these models are trained and then tested on different physics at all. In the current setting, the experiments are not sound.
- The whole paper, and especially Sections 3 and 4 (the main contributions), are not coherently written and are very hard to follow. Some objects are never defined or are used before they are defined. The presentation is very schematic and lacks many details, especially examples and interpretations that are key to understanding new concepts. For example, what is a "state-dependent tendency map" (line 143)? To the best of my knowledge, "tendency" does not refer to a common concept in this field. Also, it is not clear what "medium" (line 152) refers to. The major problem is that these are only examples of a larger problem with the whole presentation.
- While the model seems to be theoretically sound, no theoretical claims support how the composition of operators works, apart from a brief and not really understandable discussion in Section 4.1.
- Some references are wrong. For example: Hmida et al., Compositional Neural Operators for Multi-Dimensional Fluid Dynamics, is not from the main track of ICLR 2026 but from a workshop
[1] Louis Serrano et al. "Test-time generalization for physics through neural operator splitting". ICML 2026
[2] Vignesh Gopakumar et al. "Learning physical operators using neural operators." AISTATS 2026
[3] Harde et al., "Poseidon: Efficient foundation models for PDEs", NeurIPS 2024
Questions for authors
- Can the authors provide a more in-depth comparison to [1,2,3], both from a modeling and experimental point of view?
- The authors should provide more details on the presentation of the model and the composition of operators, define objects in order, and add clear physical interpretations.
- Are there any theoretical claims further supporting the model and how it works for PDEs?
3 comments
I thank the authors for the detailed response and the changes to the manuscript. However, there are substantial changes to the paper and methodology that concern me. These changes have also not been highlighted enough (even the coloring in the revised manuscript is not consistent with the changes) and raise additional comparison issues.
- Previously, the individual operators that the method composes in the final operator were somewhat general, with some physics-induced restrictions. In the revised version, the parameterization of the individual operators is much more restricted, to the point where they are tailored to the specific operator they are approximating, which is also very close to Gopakumar et al., 2026. (see next point). Sections 4.2 and 4.3, on this topic, have lots of additions that have not been properly highlighted. Most importantly, the five-mechanism experiment results changed dramatically (without highlighting them): the error at 60 steps has reduced from 0.385 to around 100 times lower (0.0034), and the number of parameters changed from around 1.6 million to 0.02 million. These potential changes in results and methodology worry me, and it is unclear if things have changed in the two versions.
- Most importantly, and directly related to the previous point, the paper is now much closer to the already mentioned baseline Gopakumar et al., 2026. In their work, the PDE is decomposed into individual operators, which are implemented analytically or learned depending on their type (linear or nonlinear). This still seems like the current description of HGL, which poses some additional constraints, but now the novelty needs further clarification.
- The new experimental comparison with LegONet and CompNO needs clarification, especially given the above points. The experimental setup in Appendix D states that these baselines have the same architecture and evaluator as HGL. For example, CompNO originally used Neural Operators to learn nonlinear operators, which are combined by a learnable final update. In this manuscript, the mechanisms seem to be approximated with MLPs. The authors should detail whether the implementation they used is the same as the original work or if their adaptation changed it substantially and, in that case, reevaluate by keeping the methods as close to the original ones, or explain if this is not possible.
- In general, many of the numerical results in tables appear to have changed, sometimes substantially, and it is not clear where these changes originate.
Overall, I am quite concerned by the changes in the paper and how these have been highlighted, and I expect more clarification from the authors, especially regarding the similarities with Gopakumar et al., 2026, possible changes in the methodology and in the results.
I remain available for further clarification from the authors, in case there have been misunderstandings or to highlight the changes in the paper.
Thank you for the review and comparison. We apologize for the incomplete highlighting in the previous version, which was meant to emphasize the key points. The updated PDF highlights every changed table entry and every sentence with new content (Tables 5, 8, and 15 in full).
The method is the same as in the original paper. Following your comments, the revision makes the order constraint explicit and applies it to every learned term, and the five-mechanism error falls from 0.385 to 0.0034.
Comment 1: The operators are more constrained, tailored to the specific operator each approximates.
Thank you for this comment. The "physics-induced restrictions" you identified in the original paper and the order constraint in the revision are the same restriction. It sets the differential order of each learned term, and a generic pointwise MLP learns the function within that class from data. In Section 4.1 of the original paper, the principal symbol "sets the leading spatial order," and when the operator is unknown, "a role-constrained symbol network" learns it. Section 4.2 grouped the principal terms into "three role-specific families" (diffusion, transport, reaction/forcing). The revision names this the order constraint, writes each term's explicit form (first-order −a(u)·∇u, zeroth-order u·g(u), forcing a free grid field), and states when the terms are identifiable. The logistic rate 1−u is learned from data, and the same classes serve the Navier–Stokes and three-dimensional systems (Table 15).
Comment 2: The paper is closer to Gopakumar et al., and the novelty needs further clarification.
Thank you for raising this. HGL shares with Gopakumar et al. the additive right-hand-side decomposition and the distinction between analytic and learned terms. In addition, HGL constrains each learned term to its mechanism's differential-order class, states when the terms are identifiable (Section 4.2), and uses the same dictionary for evolution and steady-state solves (Section 5.3). The original paper already had this constraint, and the revision names it and makes it prominent. When two mechanisms are observed only together at a fixed mixing ratio (Table 5), generic MLP terms (the Gopakumar et al. design) give 0.16 on the unseen ratio and order-constrained terms give 0.0094, 17 times lower. On the unseen five-mechanism system (same data and training budget, Table 8), generic MLP terms give 0.095 and HGL gives 0.0034, 28 times lower.
Comment 3: The five-mechanism error changed from 0.385 to 0.0034, parameters from 1.60M to 0.02M, and many other table entries changed.
Thank you for the detailed check. Following your comments and those of Reviewers auT4, 8AGa, and Gjea, the revised five-mechanism experiment gives each learned mechanism its own order-constrained term following Sections 4.1 and 4.2 of the original paper, and the error falls from 0.385 to 0.0034, about 100 times lower. In the original code, the three learned mechanisms shared one network (1.60M parameters), an implementation issue in this experiment. The best baseline remains at 0.662. Eq. (1), data, training budget, evaluation, and all baseline rows are unchanged.
| Tables | Change | Source |
|---|---|---|
| 4, 10–13, HGL | Step-60 error 0.385/0.318/0.179/0.193 → 0.0034/0.0050/0.0068/0.0069; params 1.60M → 0.02M | One order-constrained term per learned mechanism (above). |
| 1–2, HGL | HGL params 2.03M→1.53M; step-80 error 0.00036→0.00031. DPOT params in Table 1 2.22M→1.54M (errors unchanged) | HGL sized below the smallest baseline (1.54M), three seeds. DPOT count matches Table 2. |
| 3 | Single seed → three-seed median | Requested by Reviewers Gjea and 8AGa. |
| 9 | 13 of 18 rollout errors shift at 3rd digit | Recomputed with 1.53M model. |
| 5, 8, 15 | New experiments | Reviewer requests; Table 8 includes CompNO with FNO modules per your suggestion. |
| All baseline rows; 6, 7, 14 | Unchanged | — |
Comment 4: The LegONet and CompNO baselines use HGL's architecture and evaluator and should stay as close to the original methods as possible.
Thank you for this suggestion. Following it, Table 8 includes CompNO with per-mechanism FNO modules and a learned aggregator, and on the unseen five-mechanism system at step 60 the error is 0.079 (HGL: 0.0034, 23 times lower). With the aggregator trained on target-system trajectories as in the original CompNO, the error is 0.044 (13 times lower). LegONet trains by operator matching with labels from a trusted discretization, unavailable when mechanisms are unknown, so its row keeps the training objective and Strang splitting with generic MLP terms. Appendix D describes each row's relation to the original method.
Thank you again for the thorough check.
W1: The section reads as a list, and the main competitors [1, 2, 3] are only sketched.
Thank you for this suggestion. Following it, Section 2 of the revised paper now includes the detailed comparison with [1], [2] and [3]. HGL shares with [1] and [2] the additive decomposition of the right-hand side into coefficient-scaled terms. In addition, each learned term is constrained to the differential order of its mechanism, which separates mechanisms observed only in mixtures. The terms are added before evaluation, so the same composition serves evolution and steady solves, and known operators enter directly alongside learned terms. Operator splitting [1] composes pretrained operators selected by a search over a trajectory of the test system. The approach of [2] learns right-hand-side terms next to known linear terms and integrates their sum. Poseidon [3] is a pretrained solution operator that learns the flow map.
W2, Q1: There are no experimental results against [1, 2, 3], and it is unclear how the baselines are trained and tested on unseen physics.
Thank you for this suggestion. As you asked, the revised paper now includes this experimental comparison. On training systems, HGL, the physical-operator model, LegONet, and CompNO fit to relative errors below 1%. On unseen combinations, HGL is 15 to 28 times more accurate. Every baseline is trained on the same training systems, receives the same state history and mechanism coefficients, and is tested on the unseen combination (Section 5.1 of the revised paper).
These models share HGL's known operators and the same network per mechanism term, without the order constraint. They differ in training objective, in whether the terms are summed or applied by operator splitting, and in whether the mechanism coefficients are given or estimated from four context frames (Appendix D, Table 8 of the revised paper). In Table 2 of the revised paper the baselines also receive the three instantaneous mechanism tendencies (the contribution of each mechanism to ∂_t u) as input. HGL can predict the unseen system from an initial state alone. Operator splitting [1] requires a trajectory of the test system. Poseidon [3] is a pretrained solution operator, the class of the seven solution-operator baselines. These results are in Section 5.2 (Tables 4 and 5) and Appendix D of the revised paper.
W3, Q2: Sections 3 and 4 use objects that are not defined, for example "tendency" and "medium".
Thank you for these comments. Following your comments, the revised paper defines these objects in Sections 3 and 4. Section 3 defines the tendency of a mechanism as its contribution to ∂_t u, and the medium c as the spatial coefficients, material fields or geometry. Section 4.2 gives the explicit form of each learned term, with diffusion, transport, reaction and forcing as examples.
W4, Q3: No theoretical claim supports how the composition of operators works.
Thank you for this question. In response, Section 4.2 of the revised paper states that an unseen combination can be predicted if and only if its coefficient vector is a linear combination of the training coefficient vectors. When two mechanisms always appear with a fixed mixing ratio, the data determine only their sum, and the order constraint determines how the sum is divided between them. Table 5 confirms each case. The first result follows from the estimability theory of linear models (Scheffé, 1959), and the second from the identifiability theory of additive models (Hastie and Tibshirani, 1990). Both references are cited in Section 4.2 of the revised paper.
W5: The CompNO reference is wrong.
Thank you for pointing this out. The CompNO entry now cites the ICLR 2026 workshop in the revised paper.
References: [1] Operator splitting (Serrano et al., 2026). [2] Physical-operator model (Gopakumar et al., 2026). [3] Poseidon (Herde et al., 2024). Scheffé (1959), The Analysis of Variance. Hastie and Tibshirani (1990), Generalized Additive Models.