REVIEW 4 major objections 4 minor 1 cited by
This paper claims that neural PDE solvers with strong in-distribution accuracy routinely fail under structured distribution shifts, and that the severity of failure depends on both the architecture and the PDE family.
Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →
T0 review · deepseek-v4-flash
2026-08-03 09:59 UTC pith:CH7ZNEM7
load-bearing objection The core is a solid single-architecture (FNO) stress-test atlas; the abstract overclaims a three-architecture comparison that the body never provides. the 4 major comments →
Diagnosing Failure Modes of Neural Operators Across Diverse PDE Families
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
On the paper's own terms, the central discovery is that a neural operator can be a very accurate interpolant and simultaneously a brittle extrapolant: models trained to a few percent relative error on in-distribution tests can degrade by more than an order of magnitude under a shifted boundary condition or by multiple times under a changed payoff or longer rollout. The authors argue this is not random noise but a patterned failure: error concentrates in high spatial frequencies the model was never trained to represent (spectral bias), integrates over iterated rollout, and follows from overfitting to the narrow class of boundary conditions or payoff functions in the training set. They conclud
What carries the argument
The load-bearing instrument is the degradation factor D = E_stress / E_base, computed per model and averaged over 200 seeds, which normalizes out the absolute error scale and lets different PDEs and architectures be compared on the same relative scale. Around it the paper builds a stress-test protocol with five moves—parameter or coefficient shifts, boundary or terminal shifts, resolution extrapolation with Fourier decomposition of the error field, long-horizon rollouts, and input perturbation. The spectral decomposition is what turns a blunt 'error went up' into a diagnosis: the additional error under resolution shift sits at high wavenumbers, identifying spectral bias as the mechanism. For
Load-bearing premise
The ground-truth solutions used to compute every degradation factor are assumed accurate in all stress regimes, including fine grids and long chaotic rollouts; the paper itself notes that evaluating Kuramoto–Sivashinsky on a finer grid led to solver instability.
What would settle it
Sort the hundreds of trained models for one PDE by baseline error and correlate with their degradation factors under each stressor; if baseline ranking predicts stress ranking (high rank correlation), the central claim that strong in-distribution accuracy does not predict robustness fails.
If this is right
- A model with excellent in-distribution error can degrade by more than an order of magnitude under boundary or payoff shifts, so in-distribution test error alone is a weak certification.
- Resolution extrapolation is not a free lunch: aggregate error may stay flat while the missing high-frequency content is exactly the part that fails.
- Long-horizon rollouts accumulate error independent of one-step accuracy; chaotic systems such as Navier–Stokes and Kuramoto–Sivashinsky need stability-aware training or external correction.
- Small input perturbations generally do not amplify errors in these models; some models even show slightly lower error under noise, indicating a smoothing rather than amplifying behavior.
- Robustness evaluation for neural PDE solvers should be reported as a degradation profile over structured shifts, not a single test number.
Where Pith is reading between the lines
- The architecture-dependence conclusion in the abstract would need a balanced head-to-head comparison; the paper's own experiments are FNO-centric, with DeepONet mentioned only in passing, so a fair reading treats the joint-dependence claim as a hypothesis worth testing systematically.
- If degradation factors behave like this for operator learning, a natural next step is a standardized robustness leaderboard where models are compared on the same five shift families, analogous to out-of-distribution benchmarks in computer vision.
- For linear PDEs like Black–Scholes, the severe payoff-shift failure suggests an architectural lever: building the known linearity into the model (rather than hoping it is learned) should remove this failure mode; this is testable by retraining with a linearity-enforcing design.
- The models' damping of chaotic dynamics under rollout suggests hybrid schemes that hand control back to a classical solver when a drift detector flags out-of-distribution conditions; the degradation factor could serve as that detector.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper introduces a stress-testing protocol for neural PDE operators, measuring degradation factors under parameter shifts, boundary/terminal condition changes, resolution extrapolation with spectral analysis, long-horizon rollouts, and input perturbations. The protocol is applied to five PDE families (NLS, Poisson, Navier-Stokes, Black-Scholes, Kuramoto-Sivashinsky) using 200 seeds per family. The abstract claims comparisons across three architectures (FNO, DeepONet, CNO) and 750 trained models, and concludes that in-distribution accuracy does not predict robustness and that failure patterns depend jointly on architecture and PDE family. The full text, however, reports 1,000 FNO-based models, mentions only occasional DeepONet comparisons, never describes CNO experiments, and explicitly disclaims systematic architecture comparison in Section 4.
Significance. If fully supported, the proposed degradation-factor methodology and the multi-seed statistics would be a useful benchmarking contribution for neural operator robustness, and the spectral diagnostics for resolution shifts are a constructive way to expose spectral bias. The code and data availability statement is also a strength. However, the headline claims of the paper are not supported by the reported experiments: the architecture-comparison claim is contradicted by the methods and discussion, and several quantitative results are internally inconsistent. As written, the manuscript does not establish its advertised conclusions.
major comments (4)
- [Abstract vs. §2.1, §2.3, §4] The abstract claims comparison of 'three representative architectures -- FNOs, a DeepONet-style model, and convolutional neural operators (CNOs)' across '750 trained models,' and concludes that 'failure patterns depend jointly on architecture and PDE family.' The full text reports 200 seeds per PDE, i.e., 1,000 trained models (§2.3), and states 'We adopt the Fourier Neural Operator (FNO) as our primary model' (§2.1). Section 4 explicitly says 'Exploring architectural differences systematically is beyond our scope here.' No CNO experiment appears anywhere. Thus the joint architecture-by-PDE claim, which is central to the abstract's novelty, is not supported by the experiments as described.
- [§3.2, Figure 4, Table A.1] The Poisson boundary-shift result is internally contradictory. The main text states that boundary value shifts increase relative L2 error 'by over an order of magnitude' and that degradation factors exceed D>10. Figure 4's caption repeats that boundary condition shifts cause order-of-magnitude error increases. However, Appendix Table A.1 reports the boundary condition shift mean degradation as 1.503 with 95% CI [1.475, 1.531], while the order-of-magnitude value belongs to resolution extrapolation (18.186). This discrepancy undermines the specific claim that the FNO 'overfit to the restricted family of boundary value patterns' and must be corrected.
- [§2.2, §3.5] All degradation factors are ratios of model error to a ground-truth reference solution, so the reliability of the numerical solver is load-bearing. The manuscript does not report solver tolerances, timestep sizes, spatial discretization errors, or convergence checks for any PDE. The concern is amplified by Section 3.5, which states that evaluating K-S on a finer grid 'led to numerical instability in the solver.' If the reference solutions are themselves inaccurate in some stress regimes, the reported degradation factors lose their quantitative meaning. The authors should report solver validation details or at least demonstrate grid-convergence of the reference data for the stress ranges used.
- [§2.2 vs. §3.4] The Black-Scholes training setup is described inconsistently. Section 3.4 says the model was 'trained to map the payoff function... Baseline performance on smooth payoffs (e.g. vanilla call options with varying strikes) was excellent,' and the stress test uses 'a payoff function that was qualitatively different from the training set—specifically, a discontinuous payoff (a digital option).' Yet the same section later claims 'Although discontinuous payoffs were present during training, they were underrepresented relative to smooth payoff functions.' These statements cannot both be true. This matters because the payoff-shift result (D≈6.2) is one of the paper's flagship failures; the reader cannot tell what the training distribution actually contained.
minor comments (4)
- [Title/Abstract] The full-text title is 'Forcing and Diagnosing Failure Modes of Fourier Neural Operators Across Diverse PDE Families,' while the arXiv abstract title is 'Diagnosing Failure Modes of Neural Operators Across Diverse PDE Families.' The manuscript appears to have been assembled from versions with different scopes; the title, abstract, and body should be aligned.
- [§3.2, Figure 4] Figure 4's caption should be corrected to attribute the order-of-magnitude degradation to resolution extrapolation, not boundary condition shifts, based on Table A.1.
- [§2.1, §3.1–3.4] The stress magnitudes are given only qualitatively ('κ significantly larger,' 'ν half an order of magnitude smaller,' 'σ by a factor outside the training range'). Since the degradation factors depend on the chosen stress grid, the actual numerical values of the shifted parameters should be listed for reproducibility.
- [§3.4] The sentence 'Although discontinuous payoffs were present during training' appears to be a leftover from a different version; it directly contradicts the preceding stress-test description and should be removed or reconciled.
Circularity Check
No circularity: degradation factors are measured ratios, not derived from fitted targets, and no load-bearing self-citation appears.
full rationale
The paper's empirical claims rest on degradation factors defined as D = E_stress / E_base (Section 2.3). These are descriptive ratios of independently measured errors on held-out stress scenarios versus in-distribution baselines; no parameter is fitted to the target claim, and no result is imported from prior work by the same author. The only citations are external architecture and benchmark papers (Li et al., Lu et al., Kovachki et al., Pathak et al., Tancik et al.), none of which are self-citations. The central observations—e.g., Black-Scholes payoff shift factor 6.225, Navier-Stokes rollout factor 3.524—are empirical measurements, not predictions entailed by the construction of the metric. Internal inconsistencies such as the abstract's claim of 'three representative architectures' and '750 trained models' versus the body's FNO-only focus and '1,000 trained models' are correctness and completeness issues, not circularity: they do not make any derivation equivalent to its inputs. No circular step can be exhibited with a quoted reduction, so the appropriate score is 0.
Axiom & Free-Parameter Ledger
free parameters (1)
- Fixed Fourier mode count (16 modes per dimension) =
16
axioms (4)
- domain assumption The selected five PDEs are representative of diverse PDE families and their failure modes generalize to other PDEs.
- domain assumption Numerical ground-truth solvers produce accurate reference solutions at all resolutions and parameter values.
- ad hoc to paper One FNO configuration with 16 Fourier modes is a representative neural operator, so architecture-level conclusions can be drawn.
- domain assumption Worst-case degradation over a fixed stress-test grid is a conservative and meaningful measure of failure severity.
read the original abstract
Neural PDE solvers are increasingly used as learned surrogates for families of partial differential equations, where the key machine learning challenge is not only interpolation on a fixed benchmark distribution but generalization under structured shifts in coefficients, boundary conditions, discretization, and rollout horizon. Yet evaluation is still often dominated by in-distribution test error, making robustness difficult to assess. We introduce a standardized stress-testing framework for neural PDE solvers under deployment-relevant shift. We instantiate it on three representative architectures -- Fourier Neural Operators (FNOs), a DeepONet-style model, and convolutional neural operators (CNOs) -- across five qualitatively different PDE families: dispersive, elliptic, multi-scale fluid, financial, and chaotic systems. Across 750 trained models, we measure robustness using baseline-normalized degradation factors together with spectral and rollout diagnostics. The resulting comparisons reveal that strong in-distribution accuracy does not reliably predict robustness, and that failure patterns depend jointly on architecture and PDE family. Our results provide a clearer basis for evaluating robustness claims in neural PDE solvers and suggest that function-space generalization under structured shift should be treated as a first-class evaluation target.
Figures
Forward citations
Cited by 1 Pith paper
-
Spectral Audit of In-Context Operator Networks
The paper defines a Jacobian-Fourier audit that extracts frequency-dependent gains, phase structure, and cross-mode coupling from in-context operator networks to test local operator fidelity beyond prediction error.
Reference graph
Works this paper leans on
-
[1]
Neural operator: Learning maps between function spaces.arXiv preprint arXiv:2108.08481,
Nikola Kovachki, Zongyi Li, Burigede Liu, Kamyar Azizzadenesheli, Kaushik Bhattacharya, Andrew Stuart, and Anima Anandkumar. Neural operator: Learning maps between function spaces.arXiv preprint arXiv:2108.08481,
-
[3]
Jaideep Pathak, Shashank Subramanian, Peter Harrington, Sanjeev Raja, Ashesh Chattopadhyay, Morteza Mardani, Thorsten Kurth, David Hall, Zongyi Li, Kamyar Azizzadenesheli, Pedram Hassanzadeh, Karth Kashinath, and Anima Anandkumar. Fourcastnet: A global data-driven high-resolution weather model using adaptive fourier neural operators.arXiv preprint arXiv:2...
-
[2021]
URLhttps: //arxiv.org/abs/2109.01050
doi: 10.48550/arXiv.2109.01050. URLhttps: //arxiv.org/abs/2109.01050. Zongyi Li, Nikola Kovachki, Kamyar Azizzadenesheli, Burigede Liu, Kaushik Bhattacharya, Andrew Stuart, and Anima Anandkumar. Fourier neural operator for parametric partial differential equations.Interna- tional Conference on Learning Representations (ICLR),
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.