- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
Neural operators learn mappings between function spaces to solve families of PDEs efficiently, but for time-dependent problems they usually learn the temporal evolution from full transient trajectories. This paper proposes the Analytical Neural Operator (ANNO), which learns the spatial eigenmodes and modal coefficients of the solution, not the solution field directly, and reuses them across a PDE family that shares the same domain, spatial operator, and homogeneous boundary conditions. ANNO is trained only on steady-state problems: it predicts the parameters of a known eigen structure, namely the frequencies and amplitudes of trigonometric modes and the steady-state modal coefficients, while an eigenstructure loss keeps the learned modes consistent with the true eigenproblem. The trained model recovers steady-state solutions and their eigenmodes accurately, and it is reused without retraining for 1D diffusion, 2D wave, and 2D engineering thermal dynamics, with mean relative L2 errors of 0.25%, 1.86%, and 1.05%, well below those of fully supervised transient baselines. An ablation study that removes the analytical lifting, replaces the trigonometric modes with an MLP, removes the frequency-band strategy, or drops the eigenstructure loss shows that each variant has higher steady-state or transient error, with the full ANNO performing best.
Critical strengths
The key strength of ANNO is that it learns the spatial eigenmodes and modal coefficients, not the solution field directly, so a model trained only on steady-state problems can be reused for the time-dependent equations of the same PDE family without transient data or retraining. Its eigenstructure loss constrains the learned modes to satisfy the underlying eigenproblem, which makes them true eigenmodes and not just a basis that fits the steady-state data, and this is what allows them to be reused correctly in time evolution.
Critical weaknesses
The main weakness of ANNO is that it learns only the parameters (frequencies and amplitudes) of a hard-coded trigonometric eigenmode form, not the form itself, so the eigenstructure must be known in advance and the architecture cannot represent eigenmodes for variable coefficients or irregular geometries. The evaluation is also limited to linear, constant-coefficient problems on intervals and rectangles, where the eigenmodes are closed-form or can be found by simple one-dimensional root-finding, so the classical modal solution is already cheap and exact and the benefit of learning them is unclear.
Questions for authors
-
Is there evidence that predicting eigenmodes with the proposed neural operator is better than computing them with classical methods?
-
Can the method be generalized to PDE families whose eigenmodes cannot be solved trivially or whose eigen structure is not known in advance?
-
Has computing an eigendecomposition and reusing it for time-dependent problems been used in classical PDE solving, and how does ANNO differ from such methods?
6 comments
Response to Q1
Question 1
Is there evidence that predicting eigenmodes with the proposed neural operator is better than computing them with classical methods?
This question should be addressed from three aspects: prediction accuracy, online computational cost, and offline cost.
1. Prediction Accuracy Under the Same Finite Modal Budget
The original manuscript already included an ablation comparing learned and numerical modes with learned and analytical coefficients. We retrained and reevaluated these configurations using the corrected frequency bands and refined transient datasets. The results are reported in Table 33 (page 49):
| Modes / Coefficients | Median Steady-State Error | Median Full-Trajectory Error | Single-Step Time |
|---|---|---|---|
| Learned / Learned | 0.3915% | 0.6433% | 0.513 ms |
| Numerical / Learned | 0.6528% | 0.9348% | 1.594 ms |
| Learned / Analytical | 0.3470% | 0.7305% | 0.564 ms |
| Numerical / Analytical | 0.6507% | 0.9219% | 1.685 ms |
Under the same finite modal budget, the learned-mode configurations achieve lower full-trajectory errors and shorter single-step computation times.
The new Experiment 7 further compares ANNO with an optimized classical numerical modal method on an independent test dataset with time-varying Robin boundary conditions. Both methods use modes per spatial direction:
| Method | MC Mean Error | BP Mean Error |
|---|---|---|
| ANNO | 1.6681% | 0.8493% |
| CNM | 1.9912% | 1.3479% |
The results are reported in Table 2 (page 10) and Table 41 (page 55). Classical modal methods approximate solutions by truncating the eigenmode expansion, whereas ANNO learns to approximate target solutions using a finite number of modes. This explains ANNO's higher prediction accuracy under the same modal budget.
2. Online Computational Cost
Experiment 7 uses an efficient one-dimensional symmetric tridiagonal eigensolver and online lazy caching, with identical state-transfer strategies for ANNO and CNM.
| Basis Update Ratio | ANNO–MC | CNM–MC | ANNO–BP | CNM–BP |
|---|---|---|---|---|
| 0 | 0.2695 s | 0.3056 s | 0.4146 s | 0.4123 s |
| 0.5 | 0.4118 s | 0.4520 s | 0.5507 s | 0.5569 s |
| 1.0 | 0.5589 s | 0.5998 s | 0.7041 s | 0.7031 s |
The results are reported in Table 2 and Table 43 (page 56).
The original ANNO implementation uses Modal Coefficient Carry (MC), which directly carries coefficients with the same modal indices when the eigenbasis changes, avoiding explicit state reprojection. We additionally evaluated Basis Projection (BP) for both methods.
With the same caching strategy, ANNO has lower full-trajectory computation times under MC, while the two methods have comparable times under BP. Classical methods can also reduce computational costs through MC and caching. Therefore, this advantage does not imply that neural networks have universally faster temporal integration.
3. Offline Cost
We also added an offline cost analysis in Section 4.7 (page 10, lines 496–498). ANNO requires approximately 35 s for steady-state dataset generation and 3709 s for network training.
At under MC, ANNO saves 0.0409 s per trajectory compared with CNM, requiring approximately 91,500 trajectories to offset its offline costs.
Therefore, classical methods remain more economical for a small number of solves. ANNO's main advantages are higher prediction accuracy under the same finite modal budget and the ability to perform large numbers of repeated solves within the same PDE family after offline training.
Response to Q2 and 3
Question 2
Can the method be generalized to PDE families whose eigenmodes cannot be solved trivially or whose eigen structure is not known in advance?
ANNO's overall framework should be distinguished from its current trigonometric modal parameterization.
The ANNO framework consists of boundary lifting, spatial modal representation, structural constraints, and equation-specific modal time integration. It does not inherently require trigonometric eigenmodes. The trigonometric form is a structured parameterization chosen for the constant-coefficient, separable problems studied here, as explained in the original manuscript.
The original MLP Basis ablation also shows that the modal network is architecturally replaceable. However, an unstructured MLP produces larger transient errors under the current training setup, highlighting the importance of appropriate spatial inductive biases.
For higher-dimensional separable problems, the approach extends through tensor products. In this revision, we added a 3D battery-module thermal conduction experiment with a spatial grid and six modes per direction, forming 216 three-dimensional tensor-product modes. Trained only on steady-state data, ANNO achieves a mean full-trajectory error of 1.2012% across 144 transient test trajectories. The results are reported in Section 4.5 (page 8, lines 409–427) and Appendix H.
For problems with known approximate spatial structures but no simple root-finding solution, the trigonometric reconstructor could be replaced with other parameterized basis networks, while retaining operator residual, boundary residual, orthogonality, and mode-ordering constraints. This is a natural extension of ANNO.
For problems with entirely unknown eigenstructures, strongly heterogeneous coefficients, nonseparable operators, or irregular geometries, the current ANNO cannot be directly applied. This limitation and future research directions were acknowledged in the original Conclusion and Future Work section, rather than introduced only in this revision.
Question 3
Has computing an eigendecomposition and reusing it for time-dependent problems been used in classical PDE solving, and how does ANNO differ from such methods?
Yes. Computing spatial eigenstructures through separation of variables, eigenfunction expansions, or modal superposition, and reusing them for time evolution in diffusion, wave, and vibration problems, is standard in classical PDE solving. We have never claimed eigenfunction expansions or modal time integration as new contributions. The original Introduction attributes the separation of spatial representation and temporal evolution to classical PDE theory (page 1, lines 51–53).
The main difference between ANNO and classical fixed-eigenbasis reuse lies in the problem setting and how spatial structures are obtained:
- Classical methods compute an eigenbasis for a fixed spatial operator and homogeneous boundary conditions, and reuse it in subsequent solves.
- ANNO targets parametric PDE families and learns the mapping from problem parameters to spatial modes and steady-state modal responses using steady-state data.
When the spatial operator and homogeneous boundary conditions remain unchanged, classical methods can reuse cached eigenbases. When Robin parameters or the spatial operator change, a new eigenstructure is required. ANNO learns this parametric mapping through steady-state training, obtaining modes for new configurations through network inference.
Basis updates must be distinguished from state transfer. Under time-varying boundary conditions, the original ANNO uses the Modal Coefficient Carry (MC) approximation: even when the eigenbasis changes, coefficients with the same modal indices are carried directly, without explicit basis projection, trading some accuracy for efficiency. We have clarified and compared these strategies in Section 2.3 and Appendix K.
Furthermore, ANNO learns both spatial modes and their corresponding steady-state modal coefficients, reusing these structures for the temporal evolution of different equations. Its central idea is to learn reusable analytical structures from steady-state problems at the PDE-family level, rather than reuse a fixed eigenbasis for the same problem. This perspective and the absence of transient training were explained in the original Introduction (pages 1–2, lines 74–112).
The new comparison with classical numerical modal methods further demonstrates this distinction. Under the same finite modal budget and state-transfer strategy, ANNO achieves lower full-trajectory errors. With identical caching, ANNO has lower online computation times under MC, while the methods have comparable times under BP. Detailed results are provided in Section 4.7 (pages 9–10) and Appendix K.
Response to Weakness 1
Thank you for your comments and questions. We would first like to clarify that our contribution is not to reintroduce eigenfunction expansions or modal time integration, but to investigate how reusable spatial analytical structures can be learned from steady-state problems within a parametric PDE family, transferred directly to different temporal dynamics, and integrated with neural networks.
This perspective was already established in the original manuscript. We define PDEs sharing the same computational domain, spatial operator, and homogeneous boundary-condition space as a PDE family, and separate the solution process into reusable spatial analytical structures and equation-specific temporal evolution. ANNO learns the lifting function, boundary-dependent spatial modes, and modal coefficients using only steady-state data, then transfers these structures to diffusion or wave dynamics without transient training data or network retraining. The relevant discussion is provided in the revised Introduction (pages 1–2, lines 74–112).
Following the reviewers' suggestions, we added two evaluations in this revision: a full-trajectory comparison with optimized classical modal methods and an extension to 3D thermal conduction.
Critical Weakness
We agree that the current ANNO uses the known trigonometric eigenstructure as an inductive bias, and its direct applicability is limited to linear, constant-coefficient problems on regular domains with separable spatial operators. We did not claim that the current architecture can handle arbitrary variable coefficients or irregular geometries. This limitation was already acknowledged in the original Conclusion and Future Work section.
The question we investigate is whether, when the analytical structure of a PDE is known, we can avoid learning temporal evolution already prescribed by the governing equations from transient trajectories, and instead learn spatial structures reusable within a PDE family.
Importantly, knowing the analytical form does not mean that obtaining the eigenstructure across a parametric PDE family is computationally free. For a fixed spatial operator and homogeneous boundary conditions, classical methods can compute the eigenbasis once and reuse it indefinitely. However, when Robin parameters or the spatial operator change, classical methods must compute a new eigenstructure. ANNO instead learns the mapping from problem parameters to spatial modes and modal responses through steady-state training, allowing modes for new configurations to be obtained through network inference.
We added a full-trajectory comparison with classical numerical modal methods. Under the same finite modal budget, ANNO achieves lower prediction errors with both MC and BP state-transfer strategies. With the same online caching strategy, ANNO is slightly faster under MC, while their computation times are comparable under BP. Detailed results are provided in Section 4.7 (pages 9–10) and Appendix K.
We understand the reviewer's concern regarding variable coefficients and irregular geometries, which the current ANNO cannot directly handle. This limitation was already identified in the original manuscript and remains an important direction for our future work.