- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper introduces a framework designed to address two interconnected aspects of adaptive neural operator learning.
The method combines physics-informed adaptive node allocation with geometry-conditioned low-rank feature transport. The allocation module uses physical indicators, including gradients, Laplacians, energy, and vorticity-related quantities, to guide node relocation. The transport module maps source-node features into target-conditioned representation contexts before aggregation. The architecture additionally incorporates spectral and differential residual corrections.
The authors introduce the concept of operator readability and provide theoretical conditions for representation-consistent aggregation and approximate transport. Experiments on five PDE benchmarks: Navier–Stokes, Rayleigh–Bénard convection, Kuramoto–Sivashinsky, Kolmogorov flow, and Darcy flow, demonstrate competitive prediction accuracy. Ablation studies, allocation counterfactuals, edge interventions, and geometric-mismatch analyses further investigate the behavior of the proposed mechanisms.
Critical strengths
- A formulation of adaptive computation that considers both resource allocation and feature interaction.
- Experimental evaluation with informative mechanism-level interventions.
Critical weaknesses
- The benefit specifically attributable to Gauge transport is not fully isolated from architectural capacity and other correction mechanisms.
- The theoretical interpretation and generalization of the learned transport remain limited.
Questions for authors
- compare GA-AMNO with a parameter and compute matched geometry conditioned message passing architecture that does not use the proposed Gauge transport parameterization. Both models should retain the same adaptive allocation, spectral correction, and differential correction modules, with independently trained parameters. This would help isolate the specific contribution of Gauge transport.
- How does GA-AMNO perform on substantially nonuniform or anisotropic meshes, or under larger discretization changes than those evaluated?
2 comments
Response to Reviewer Pue4 (2/2)
W2 & Q2. Theoretical interpretation and applicability under nonuniform discretizations.
A2. Our theory explains when source-to-target transport makes aggregation consistent across local representations, and what controls the error when the learned transport is only approximate. The key idea is to re-express each source feature in the target node’s representation before combining messages (Appendix D.2, Eqs. (19)–(20)). Theorem 1 concerns shared linear aggregation with unchanged scalar weights. Theorem 2 gives sufficient conditions for consistent aggregation: the transport map transforms consistently at both endpoints, and scalar attention weights stay unchanged. Theorem 3 then bounds the aggregation inconsistency by separating changes in neighbor weighting from errors in the channel transformation. Proposition 1 characterizes what the diagonal-plus-low-rank map can approximate, while Proposition 2 and Corollary 1 show how the effects of topology-preserving mesh deformations propagate from individual messages to the prediction under the stated assumptions. Exact equivariance is the reference case for changes of representation, not the objective under re-discretization. A change of frame re-expresses the same information, whereas a change in sampling scale, orientation, or spatial support can change the information the encoder receives. GA-AMNO therefore learns how to adapt each incoming message to the target’s local geometry before aggregation; the theory explains what this design buys us and how deviations from the ideal affect the aggregate.
We add a Darcy evaluation across nonuniform and directionally varying meshes. Section 4.4 and Table 2 compare regular, clustered, sheared, twisted, and adaptive layouts. Clustering changes node spacing and spatial distribution, while shear and twist alter local directions and neighborhood geometry. A model is trained separately for each prescribed mesh, and the identity intervention replaces transport in its selected checkpoint. The comparison therefore examines the predictive role of the same transport design across trained configurations.
| Mesh | Identity intervention | Gauge transport | Relative error reduction |
|---|---|---|---|
| Regular | 0.036462 | 0.027931 | 23.40% |
| Clustered | 0.084856 | 0.028481 | 66.44% |
| Sheared | 0.141653 | 0.026229 | 81.48% |
| Twisted | 0.233945 | 0.026600 | 88.63% |
| Adaptive | 0.057072 | 0.026827 | 52.99% |
Transport is useful across the tested geometries, with larger relative intervention effects on the nonuniform layouts. Errors with gauge transport lie within 0.026229–0.028481, compared with the wider error range under identity replacement. Its regular-grid benefit shows that explicit adaptation is not required, while the larger effects on clustered, sheared, and twisted meshes support considering local geometric context in information exchange. These results demonstrate the applicability of the proposed transport design across the tested mesh-specific configurations.
Summary Response
We thank you for recognizing the allocation–interaction formulation and mechanism-level evaluations. We add an independently trained dense-kernel control with the remaining modules retained to isolate the benefit of structured transport (A1). We clarify the assumptions and limits of the theoretical interpretation and evaluate nonuniform and directionally varying mesh configurations (A2). We hope these results and clarifications address your concerns about attribution and scope.
Response to Reviewer Pue4 (1/2)
W1 & Q1. Isolating the benefit of Gauge transport from capacity and correction mechanisms.A1. We use ablations to clarify what each component contributes. Allocation shapes interaction geometry, Gauge transport transforms messages, and the correction modules refine the output field. Classic serves only as a system-level comparison between the full GA-AMNO architecture and a conventional adaptive solver. In Fig. 4, Identity Transport replaces learned transport with the identity map while retaining the adaptive mesh, importance weighting, and both spectral and differential corrections. This replacement increases prediction error, most notably on Kolmogorov. The allocation-module ablation in Fig. 4 fixes the node coordinates, switches off importance-based feature gating and the physical-allocation loss, and retains gauge transport. The separate importance-map interventions distinguish the displacement and feature-gating paths, and Fig. 8 reports targeted ablations of the correction modules.
We compare GA-AMNO with an independently trained dense-kernel control. With the other modules unchanged and comparable capacity and compute, GA-AMNO achieves better spatial accuracy on all three benchmarks. The control replaces only the Gauge matrix-generation heads with an MLP that generates a full transport map from the same edge descriptor. Scalar attention, adaptive allocation, mesh-to-grid reconstruction, and the spectral and differential prediction heads are retained. Both variants are trained independently with comparable parameter counts and computational costs. Appendix C.4.3 specifies the protocol, and Appendix F.2, Table 5 reports the results below.
The matched comparison shows that the spatial gains extend to regions where the solution varies sharply. Edge interventions further show that replacing transport on top-ranked edges changes predictions more than replacing it on random or bottom-ranked edges. With the same prediction heads, structured transport achieves lower full-field, high-gradient-region, and Laplacian errors across all three benchmarks. These gains extend beyond average field accuracy: the model better resolves regions where the solution varies sharply and more accurately captures second-order spatial variation. The dense kernel achieves slightly lower spectral error on Navier–Stokes, a result consistent with the spectral metric measuring Fourier energy without directly assessing spatial phase. Fig. 5(b) shows where the learned transformations matter most: replacing transport with the identity on top-ranked edges changes predictions more than doing so on random or bottom-ranked edges. Together, the matched comparison shows what the structured parameterization contributes to spatial accuracy, while the edge interventions identify which learned transformations have the greatest influence on the prediction.