pith. sign in

arxiv: 2605.18606 · v1 · pith:FY6Z2RD7new · submitted 2026-05-18 · 💻 cs.LG

Physics-Aligned Canonical Equivariant Fourier Neural Operator under Symmetry-Induced Shifts

Pith reviewed 2026-05-20 12:25 UTC · model grok-4.3

classification 💻 cs.LG
keywords neural operatorsFourier neural operatorequivariant learningsymmetry in PDEsout-of-distribution generalizationphysics-informed machine learningLie algebra estimationGalilean invariance
0
0 comments X

The pith

A neural operator estimates the symmetry frame of a PDE input, maps it to a canonical reference, runs standard Fourier layers, and maps the output back to improve generalization under shifts.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proposes separating coordinate alignment from physical evolution in neural operators for PDEs on periodic domains. By using a Lie-algebra estimator to detect continuous symmetries such as translations and Galilean boosts, the method transforms the input field to a fixed reference frame, applies an unmodified Fourier Neural Operator, and restores the predicted field to the original frame. Training uses bounded random perturbations of these symmetries to learn a joint alignment and prediction map. This yields matching accuracy on in-distribution data while cutting relative error on out-of-distribution shifted cases by up to twelve times compared with symmetry-augmented baselines. Ablations confirm that the input alignment and output restoration steps drive most of the observed gains.

Core claim

PACE-FNO estimates the input frame with a Lie-algebra coordinate estimator, maps the field to a reference frame, applies a standard Fourier Neural Operator, and restores the prediction to the target frame. Equivariance is enforced solely by the input and output transformations while the FNO architecture remains unchanged. The model is trained jointly on alignment and operator prediction using bounded symmetry perturbations, with an optional low-dimensional refinement step that updates the estimated frame at inference. On 1-D and 2-D Burgers, shallow-water, and Navier-Stokes equations, this produces in-distribution accuracy comparable to standard neural operators and reduces out-of-distibuti

What carries the argument

Physics-Aligned Canonical Equivariant Fourier Neural Operator (PACE-FNO), which uses a Lie-algebra coordinate estimator to align the input field to a canonical reference frame before standard FNO processing and restores the output frame afterward.

If this is right

  • Aligning the input and restoring the output frame account for the majority of out-of-distribution error reduction under translations and Galilean shifts.
  • Optional inference-time refinement of the estimated frame supplies a smaller additional correction.
  • The approach preserves full equivariance without any architectural change to the underlying Fourier Neural Operator.
  • Gains are largest for pure translation and Galilean shifts and smaller for coupled rotation-translation shifts.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same separation of alignment from evolution could be tested on non-periodic domains by replacing the Lie-algebra estimator with a boundary-aware symmetry detector.
  • Combining PACE-style alignment with other base operators such as graph or attention layers might extend the OOD improvements to irregular meshes.
  • If symmetry estimation proves stable across time steps, the method could support long-horizon rollouts where frame drift would otherwise accumulate.

Load-bearing premise

The governing PDEs must admit continuous symmetries such as translations or Galilean boosts that can be estimated reliably from a single snapshot.

What would settle it

Run PACE-FNO on a PDE whose solutions lack continuous symmetries or on data where single-snapshot symmetry estimation error exceeds the bounded perturbations used in training; if OOD relative error remains comparable to standard FNO with augmentation, the alignment separation provides no gain.

Figures

Figures reproduced from arXiv: 2605.18606 by Changhong Mou, Fengxiang He, Jiaxiao Xu, Yeyu Zhang.

Figure 1
Figure 1. Figure 1: Geometric view of PACE-FNO. (a) The input is pulled from its observed orbit to a canonical [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: PACE-FNO pipeline. (a) The Lie-algebra encoder predicts [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: OOD prediction of PACE-FNO on 2-D Burgers under translation and Galilean drift (full [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: OOD prediction of PACE-FNO on the 2-D shallow-water system under Galilean perturbation [PITH_FULL_IMAGE:figures/full_fig_p008_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: OOD prediction of PACE-FNO under SE(2) perturbations for (2 + 1)-D Navier-Stokes (full comparison in Appendix [PITH_FULL_IMAGE:figures/full_fig_p008_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Empirical landscape of JTTA on 2-D Burgers. The landscape is non-convex with symmetry￾induced low-energy basins, and descent from the estimator initialization converges to one valid basin [PITH_FULL_IMAGE:figures/full_fig_p009_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: TTA sensitivity for the (2 + 1)-D Navier-Stokes equation. The error reduction is stable across the tested learning rates and step counts. 5 Conclusions PACE-FNO separates frame alignment from PDE evolution by estimating input-frame symmetry coordinates, applying a standard FNO on a canonical slice, and mapping the output back to the target frame. The error decomposition makes approximation and alignment te… view at source ↗
Figure 8
Figure 8. Figure 8: Canonicalization on 1-D Burgers. The physical panels show the translated and boosted [PITH_FULL_IMAGE:figures/full_fig_p017_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: OOD prediction on 1-D Burgers under translation and Galilean drift. PACE-FNO aligns the [PITH_FULL_IMAGE:figures/full_fig_p018_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: Canonicalization on 2-D Burgers. The learned pullback removes the dominant spatial [PITH_FULL_IMAGE:figures/full_fig_p020_10.png] view at source ↗
Figure 11
Figure 11. Figure 11: OOD prediction on 2-D Burgers under translation and Galilean drift. PACE-FNO more [PITH_FULL_IMAGE:figures/full_fig_p021_11.png] view at source ↗
Figure 12
Figure 12. Figure 12: Canonicalization behavior of PACE-FNO under Galilean perturbations for the 2-D shallow [PITH_FULL_IMAGE:figures/full_fig_p023_12.png] view at source ↗
Figure 13
Figure 13. Figure 13: OOD prediction on the 2-D shallow-water system under Galilean perturbation. PACE-FNO [PITH_FULL_IMAGE:figures/full_fig_p024_13.png] view at source ↗
Figure 14
Figure 14. Figure 14: Canonicalization on the (2 + 1)-dimensional Navier-Stokes setting. The learned frame correction reduces the imposed translation-rotation shift before rollout, so the latent representation is closer to the canonical training regime. 26 [PITH_FULL_IMAGE:figures/full_fig_p026_14.png] view at source ↗
Figure 15
Figure 15. Figure 15: OOD prediction under SE(2) perturbations for the (2 + 1)-dimensional Navier-Stokes equations. PACE-FNO more accurately preserves vortex placement and rollout geometry; the remaining gap reflects the coupled rotation-translation alignment error. 27 [PITH_FULL_IMAGE:figures/full_fig_p027_15.png] view at source ↗
Figure 16
Figure 16. Figure 16: TTA sensitivity on the 2-D shallow-water system. The OOD relative error is nearly flat [PITH_FULL_IMAGE:figures/full_fig_p029_16.png] view at source ↗
read the original abstract

Neural operators approximate PDE solution maps, but they need not respect the symmetries of the governing equation. In out-of-distribution (OOD) regimes, a standard neural operator must often learn coordinate alignment and physical evolution within a single map, which can hurt generalization. We use known continuous symmetries of evolution equations on periodic domains to separate these two roles. We propose the Physics-Aligned Canonical Equivariant Fourier Neural Operator (PACE-FNO), which estimates the input frame with a Lie-algebra coordinate estimator, maps the field to a reference frame, applies a standard Fourier Neural Operator (FNO), and restores the prediction to the target frame. We train alignment and operator prediction jointly using bounded symmetry perturbations, with an optional low-dimensional refinement step that updates the estimated frame at inference. Equivariance is enforced by the input and output transformations, while the FNO architecture remains unchanged. Across 1-D and 2-D Burgers, shallow-water, and Navier-Stokes equations on periodic domains, PACE-FNO matches the in-distribution (ID) accuracy of standard neural operators and reduces out-of-distribution (OOD) relative error by up to 12x over FNO with symmetry augmentation (FNO+Aug) under translations and Galilean shifts, with smaller gains for coupled rotation-translation shifts. Ablations show that aligning the input and restoring the output frame account for most OOD gains; inference-time refinement provides a smaller correction.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript introduces the Physics-Aligned Canonical Equivariant Fourier Neural Operator (PACE-FNO). It estimates an input frame via a Lie-algebra coordinate estimator, maps the field to a reference frame, applies an unmodified Fourier Neural Operator, and restores the prediction to the target frame. The approach is trained jointly using bounded symmetry perturbations (with optional inference-time refinement) and is evaluated on 1-D/2-D Burgers, shallow-water, and Navier-Stokes equations on periodic domains. It claims to match in-distribution accuracy of standard neural operators while reducing out-of-distribution relative error by up to 12x versus FNO with symmetry augmentation under translations and Galilean shifts (smaller gains for coupled rotation-translation shifts), with ablations attributing most OOD gains to the alignment and restoration steps.

Significance. If the central claims hold, the work demonstrates a practical way to exploit known continuous symmetries to separate coordinate alignment from physical evolution inside neural operators, improving OOD generalization without architectural changes to the FNO core. The joint training protocol, the optional refinement step, and the ablations that isolate the contribution of alignment/restoration are concrete strengths that support the reported error reductions.

major comments (2)
  1. [Training protocol and OOD evaluation (abstract and §4)] Training uses only bounded random symmetry perturbations, yet OOD tests apply larger translations, Galilean boosts, and coupled rotations that exceed those bounds. If the Lie-algebra estimator error grows with shift size, the FNO receives inputs that deviate from the true canonical frame, so the up-to-12x OOD error reduction cannot be attributed solely to the separation of alignment and evolution. Report frame-estimation error on the OOD test sets or provide a robustness analysis for shifts beyond the training perturbation magnitude.
  2. [Ablation studies] The ablation results isolate the alignment/restoration steps as the source of most OOD gains, but these ablations are performed within the same bounded-perturbation regime used for training. They do not directly verify estimator accuracy under the larger OOD shifts of the main experiments, leaving the load-bearing attribution of the 12x improvement partially untested.
minor comments (2)
  1. [Experimental setup] Exact training hyperparameters, optimizer settings, and the precise architecture of the low-dimensional refinement step are not fully detailed, limiting reproducibility.
  2. [Method description] Clarify the mathematical definition of the Lie-algebra coordinate estimator (including how the frame is represented and restored) and any assumptions on the domain periodicity.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive feedback on our manuscript. The comments highlight important aspects of our training protocol and evaluation strategy. We address each major comment below and will incorporate revisions to strengthen the paper.

read point-by-point responses
  1. Referee: [Training protocol and OOD evaluation (abstract and §4)] Training uses only bounded random symmetry perturbations, yet OOD tests apply larger translations, Galilean boosts, and coupled rotations that exceed those bounds. If the Lie-algebra estimator error grows with shift size, the FNO receives inputs that deviate from the true canonical frame, so the up-to-12x OOD error reduction cannot be attributed solely to the separation of alignment and evolution. Report frame-estimation error on the OOD test sets or provide a robustness analysis for shifts beyond the training perturbation magnitude.

    Authors: We agree that explicitly reporting frame-estimation accuracy on the OOD test sets would strengthen the attribution of gains to the alignment mechanism. The joint training protocol is designed such that the estimator learns to predict Lie-algebra coordinates under bounded perturbations while the overall system (alignment + FNO + restoration) generalizes to larger shifts, as evidenced by the reported OOD improvements. The optional inference-time refinement step further mitigates potential estimator drift for larger shifts. In the revised manuscript, we will add a new subsection with tables reporting the frame-estimation error (e.g., mean L2 distance between estimated and ground-truth frame parameters) on all OOD test sets for translations, Galilean shifts, and coupled rotation-translation cases. This will directly address whether estimator error remains controlled beyond training bounds and clarify the contribution of alignment versus refinement. revision: yes

  2. Referee: [Ablation studies] The ablation results isolate the alignment/restoration steps as the source of most OOD gains, but these ablations are performed within the same bounded-perturbation regime used for training. They do not directly verify estimator accuracy under the larger OOD shifts of the main experiments, leaving the load-bearing attribution of the 12x improvement partially untested.

    Authors: The ablations were performed in the bounded regime to provide a controlled isolation of the alignment and restoration contributions under the exact training distribution. However, we acknowledge that extending this verification to the larger OOD shifts would more rigorously support the attribution in the main results. We will revise the ablation section to include frame-estimation error metrics computed on the OOD test sets (using the same ablation variants), allowing direct comparison of estimator performance under larger shifts. This addition will confirm that the OOD gains remain attributable to the alignment/restoration steps even when shifts exceed training bounds. revision: yes

Circularity Check

0 steps flagged

No significant circularity in the claimed separation of alignment and evolution

full rationale

The paper separates symmetry alignment (via a jointly trained Lie-algebra coordinate estimator that produces an explicit frame transformation) from the unchanged FNO evolution operator. Training uses bounded random symmetry perturbations, but OOD evaluation applies held-out larger translations, Galilean shifts, and rotations that were never seen during fitting. The reported error reductions are therefore measured on genuinely unseen inputs rather than quantities that reduce to the training fit by construction. No self-definitional steps, fitted parameters renamed as predictions, or load-bearing self-citations appear in the derivation; the central claim remains an architectural and empirical separation that is independently testable against external benchmarks.

Axiom & Free-Parameter Ledger

1 free parameters · 1 axioms · 0 invented entities

The central claim rests on the existence of continuous symmetries that can be represented by a low-dimensional Lie algebra and on the assumption that a neural estimator can recover the group element from a single field snapshot. No new physical constants or particles are introduced.

free parameters (1)
  • bound on symmetry perturbation magnitude
    The range of random translations, boosts, and rotations used during joint training is chosen by hand and directly affects how well the aligner generalizes.
axioms (1)
  • domain assumption The PDE admits continuous symmetries (translations, Galilean boosts) that leave the equation invariant on periodic domains.
    Invoked in the first paragraph of the abstract and used to justify the canonical-frame mapping.

pith-pipeline@v0.9.0 · 5792 in / 1600 out tokens · 39071 ms · 2026-05-20T12:25:39.339423+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

53 extracted references · 53 canonical work pages · 3 internal anchors

  1. [1]

    Kevrekidis, Lu Lu, Paris Perdikaris, Sifan Wang, and Liu Yang

    George Em Karniadakis, Ioannis G. Kevrekidis, Lu Lu, Paris Perdikaris, Sifan Wang, and Liu Yang. Physics-informed machine learning.Nature Reviews Physics, 3(6):422–440, 2021

  2. [2]

    Fourier neural operator for parametric partial differen- tial equations

    Zongyi Li, Nikola Kovachki, Kamyar Azizzadenesheli, Burigede Liu, Kaushik Bhattacharya, Andrew Stuart, and Anima Anandkumar. Fourier neural operator for parametric partial differen- tial equations. InInternational Conference on Learning Representations, 2021

  3. [3]

    DeepONet: Learning nonlinear operators for identifying differential equations based on the universal approximation theorem of operators

    Lu Lu, Pengzhan Jin, and George Em Karniadakis. DeepONet: Learning nonlinear operators for identifying differential equations based on the universal approximation theorem of operators. Nature Machine Intelligence, 3:218–229, 2021

  4. [4]

    Neural operator: Learning maps between function spaces with applications to PDEs.Journal of Machine Learning Research, 24(89):1–97, 2023

    Nikola Kovachki, Zongyi Li, Burigede Liu, Kamyar Azizzadenesheli, Kaushik Bhattacharya, Andrew Stuart, and Anima Anandkumar. Neural operator: Learning maps between function spaces with applications to PDEs.Journal of Machine Learning Research, 24(89):1–97, 2023

  5. [5]

    A mathematical guide to operator learning

    Nicolas Boullé and Alex Townsend. A mathematical guide to operator learning. InHandbook of Numerical Analysis, volume 25, pages 83–125. Elsevier, 2024. doi: 10.1016/bs.hna.2024.05. 003

  6. [6]

    Gege Wen, Zongyi Li, Kamyar Azizzadenesheli, Anima Anandkumar, and Sally M. Benson. U-FNO: An enhanced Fourier neural operator-based deep-learning model for multiphase flow. Advances in Water Resources, 163:104180, 2022

  7. [7]

    FourCastNet: A Global Data-driven High-resolution Weather Model using Adaptive Fourier Neural Operators

    Jaideep Pathak, Shashank Subramanian, Peter Harrington, Sanjeev Raja, Ashesh Chattopadhyay, Morteza Mardani, Thorsten Kurth, David Hall, Zongyi Li, Kamyar Azizzadenesheli, Pedram Hassanzadeh, Karthik Kashinath, and Anima Anandkumar. FourCastNet: A global data- driven high-resolution weather model using adaptive Fourier neural operators.arXiv preprint arXi...

  8. [8]

    Message passing neural PDE solvers

    Johannes Brandstetter, Daniel Worrall, and Max Welling. Message passing neural PDE solvers. InInternational Conference on Learning Representations, 2022

  9. [9]

    PDE-refiner: Achieving accurate long rollouts with neural PDE solvers

    Phillip Lippe, Bastiaan Veeling, Paris Perdikaris, Richard Turner, and Johannes Brandstetter. PDE-refiner: Achieving accurate long rollouts with neural PDE solvers. InAdvances in Neural Information Processing Systems, volume 36, pages 67398–67433, 2023

  10. [10]

    Olver.Applications of Lie Groups to Differential Equations, volume 107

    Peter J. Olver.Applications of Lie Groups to Differential Equations, volume 107. Springer Science & Business Media, 1993

  11. [11]

    Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges

    Michael M. Bronstein, Joan Bruna, Taco Cohen, and Petar Veliˇckovi´c. Geometric deep learning: Grids, groups, graphs, geodesics, and gauges.arXiv preprint arXiv:2104.13478, 2021

  12. [12]

    Generalizing convolutional neural networks for equivariance to Lie groups on arbitrary continuous data

    Marc Finzi, Samuel Stanton, Pavel Izmailov, and Andrew Gordon Wilson. Generalizing convolutional neural networks for equivariance to Lie groups on arbitrary continuous data. In International Conference on Machine Learning, pages 3165–3176. PMLR, 2020

  13. [13]

    Alias-free mamba neural operator

    Jianwei Zheng, Wei Li, Ni Xu, Junwei Zhu, Xiaoxu Lin, and Xiaoqin Zhang. Alias-free mamba neural operator. InAdvances in Neural Information Processing Systems, volume 37, pages 52962–52995, 2024

  14. [14]

    Lie algebra canonicalization: Equivariant neural operators under arbitrary Lie groups

    Zakhar Shumaylov, Pavel Zaika, Jacob Rowbottom, Ferdia Sherry, Melanie Weber, and Carola- Bibiane Schönlieb. Lie algebra canonicalization: Equivariant neural operators under arbitrary Lie groups. InInternational Conference on Learning Representations, 2025

  15. [15]

    Smith, and Yaron Lipman

    Omri Puny, Matan Atzmon, Heli Ben-Hamu, Ishan Misra, Aditya Grover, Edward J. Smith, and Yaron Lipman. Frame averaging for invariant and equivariant network design. InInternational Conference on Learning Representations, 2022

  16. [16]

    Equivariance with learned canonicalization functions

    Sékou-Oumar Kaba, Arnab Kumar Mondal, Yan Zhang, Yoshua Bengio, and Siamak Ravan- bakhsh. Equivariance with learned canonicalization functions. InInternational Conference on Machine Learning, pages 15546–15566. PMLR, 2023. 10

  17. [17]

    A canonicalization perspective on invariant and equivariant learning

    George Ma, Yifei Wang, Derek Lim, Stefanie Jegelka, and Yisen Wang. A canonicalization perspective on invariant and equivariant learning. InAdvances in Neural Information Processing Systems, volume 37, 2024

  18. [18]

    Nadav Dym, Hannah Lawrence, and Jonathan W. Siegel. Equivariant frames and the impossibil- ity of continuous canonicalization.arXiv preprint arXiv:2402.16077, 2024

  19. [19]

    Incorporating symmetry into deep dynamics models for improved generalization.arXiv preprint arXiv:2002.03061, 2020

    Rui Wang, Robin Walters, and Rose Yu. Incorporating symmetry into deep dynamics models for improved generalization.arXiv preprint arXiv:2002.03061, 2020

  20. [20]

    Johannes Brandstetter, Max Welling, and Daniel E. Worrall. Lie point symmetry data aug- mentation for neural PDE solvers. InInternational Conference on Machine Learning, pages 2241–2256. PMLR, 2022

  21. [21]

    Lie point symmetry and physics-informed networks

    Tara Akhound-Sadegh, Laurence Perreault-Levasseur, Johannes Brandstetter, Max Welling, and Siamak Ravanbakhsh. Lie point symmetry and physics-informed networks. InAdvances in Neural Information Processing Systems, volume 36, pages 42468–42481, 2023

  22. [22]

    Group equivariant convolutional networks

    Taco Cohen and Max Welling. Group equivariant convolutional networks. InInternational Conference on Machine Learning, pages 2990–2999. PMLR, 2016

  23. [23]

    Bart M. N. Smets, Jim Portegies, Erik J. Bekkers, and Remco Duits. PDE-based group equivariant convolutional neural networks.Journal of Mathematical Imaging and Vision, 65: 209–239, 2023

  24. [24]

    Learning mesh- based simulation with graph networks

    Tobias Pfaff, Meire Fortunato, Alvaro Sanchez-Gonzalez, and Peter Battaglia. Learning mesh- based simulation with graph networks. InInternational Conference on Learning Representations, 2021

  25. [25]

    Multipole graph neural operator for parametric partial differential equations

    Zongyi Li, Nikola Kovachki, Kamyar Azizzadenesheli, Burigede Liu, Andrew Stuart, Kaushik Bhattacharya, and Anima Anandkumar. Multipole graph neural operator for parametric partial differential equations. InAdvances in Neural Information Processing Systems, volume 33, pages 6755–6766, 2020

  26. [26]

    Choose a transformer: Fourier or Galerkin

    Shuhao Cao. Choose a transformer: Fourier or Galerkin. InAdvances in Neural Information Processing Systems, volume 34, pages 15437–15450, 2021

  27. [27]

    Tapas Tripura and Souvik Chakraborty. Wavelet neural operator for solving parametric partial differential equations in computational mechanics problems.Computer Methods in Applied Mechanics and Engineering, 404:115783, 2023

  28. [28]

    Laplace neural operator for solving differential equations.Nature Machine Intelligence, 6:631–640, 2024

    Qianying Cao, Somdatta Goswami, and George Em Karniadakis. Laplace neural operator for solving differential equations.Nature Machine Intelligence, 6:631–640, 2024

  29. [29]

    Kirillov.An Introduction to Lie Groups and Lie Algebras, volume 113

    Alexander A. Kirillov.An Introduction to Lie Groups and Lie Algebras, volume 113. Cambridge University Press, 2008

  30. [30]

    John M. Lee. Smooth manifolds. InIntroduction to Smooth Manifolds, pages 1–29. Springer, 2003

  31. [31]

    Group equivariant Fourier neural operators for partial differential equations

    Jacob Helwig, Xuan Zhang, Cong Fu, Jerry Kurtin, Stephan Wojtowytsch, and Shuiwang Ji. Group equivariant Fourier neural operators for partial differential equations. InInternational Conference on Machine Learning, pages 13376–13411. PMLR, 2023

  32. [32]

    Factorized Fourier neural operators

    Alasdair Tran, Alexander Mathews, Lexing Xie, and Cheng Soon Ong. Factorized Fourier neural operators. InInternational Conference on Learning Representations, 2023

  33. [33]

    Alan W. Paeth. A fast algorithm for general raster rotation. InGraphics Gems, pages 179–195. Academic Press, 1990

  34. [34]

    Convolution-based interpolation for fast, high-quality rotation of images.IEEE Transactions on Image Processing, 4(10): 1371–1381, 1995

    Michael Unser, Philippe Thevenaz, and Leonid Yaroslavsky. Convolution-based interpolation for fast, high-quality rotation of images.IEEE Transactions on Image Processing, 4(10): 1371–1381, 1995. 11

  35. [35]

    Understanding and mitigating gradient flow pathologies in physics-informed neural networks.SIAM Journal on Scientific Computing, 43 (5):A3055–A3081, 2021

    Sifan Wang, Yujun Teng, and Paris Perdikaris. Understanding and mitigating gradient flow pathologies in physics-informed neural networks.SIAM Journal on Scientific Computing, 43 (5):A3055–A3081, 2021

  36. [36]

    GradNorm: Gra- dient normalization for adaptive loss balancing in deep multitask networks

    Zhao Chen, Vijay Badrinarayanan, Chen-Yu Lee, and Andrew Rabinovich. GradNorm: Gra- dient normalization for adaptive loss balancing in deep multitask networks. InInternational Conference on Machine Learning, pages 794–803. PMLR, 2018

  37. [37]

    Hamprecht, Yoshua Bengio, and Aaron Courville

    Nasim Rahaman, Aristide Baratin, Devansh Arpit, Felix Draxler, Min Lin, Fred A. Hamprecht, Yoshua Bengio, and Aaron Courville. On the spectral bias of neural networks. InInternational Conference on Machine Learning, pages 5301–5310. PMLR, 2019

  38. [38]

    Frequency principle: Fourier analysis sheds light on deep neural networks.Communications in Computational Physics, 28(5):1746–1767, 2020

    Zhi-Qin John Xu, Yaoyu Zhang, Tao Luo, Yanyang Xiao, and Zheng Ma. Frequency principle: Fourier analysis sheds light on deep neural networks.Communications in Computational Physics, 28(5):1746–1767, 2020

  39. [39]

    Du, Ken-ichi Kawarabayashi, and Stefanie Jegelka

    Keyulu Xu, Mozhi Zhang, Jingling Li, Simon S. Du, Ken-ichi Kawarabayashi, and Stefanie Jegelka. How neural networks extrapolate: From feedforward to graph neural networks. In International Conference on Learning Representations, 2021

  40. [40]

    Tent: Fully test-time adaptation by entropy minimization

    Dequan Wang, Evan Shelhamer, Shaoteng Liu, Bruno Olshausen, and Trevor Darrell. Tent: Fully test-time adaptation by entropy minimization. InInternational Conference on Learning Representations, 2021

  41. [41]

    Efros, and Moritz Hardt

    Yu Sun, Xiaolong Wang, Zhuang Liu, John Miller, Alexei A. Efros, and Moritz Hardt. Test-time training with self-supervision for generalization under distribution shifts. InInternational Conference on Machine Learning, pages 9229–9248. PMLR, 2020

  42. [42]

    TeST: Test-time self- training under distribution shift

    Samarth Sinha, Peter Gehler, Francesco Locatello, and Bernt Schiele. TeST: Test-time self- training under distribution shift. InIEEE/CVF Winter Conference on Applications of Computer Vision, 2022

  43. [43]

    Rusu, Kieran Milan, John Quan, Tiago Ramalho, Agnieszka Grabska-Barwinska, Demis Hassabis, Claudia Clopath, Dharshan Kumaran, and Raia Hadsell

    James Kirkpatrick, Razvan Pascanu, Neil Rabinowitz, Joel Veness, Guillaume Desjardins, An- drei A. Rusu, Kieran Milan, John Quan, Tiago Ramalho, Agnieszka Grabska-Barwinska, Demis Hassabis, Claudia Clopath, Dharshan Kumaran, and Raia Hadsell. Overcoming catastrophic forgetting in neural networks.Proceedings of the National Academy of Sciences, 114(13): 35...

  44. [44]

    Robert M. French. Catastrophic forgetting in connectionist networks.Trends in Cognitive Sciences, 3(4):128–135, 1999

  45. [45]

    PDEBench: An extensive benchmark for scientific machine learning

    Makoto Takamoto, Timothy Praditia, Raphael Leiteritz, Dan MacKinlay, Francesco Alesiani, Dirk Pflüger, and Mathias Niepert. PDEBench: An extensive benchmark for scientific machine learning. InAdvances in Neural Information Processing Systems, volume 35, 2022

  46. [46]

    Learning chaotic dynamics in dissipative systems

    Zongyi Li, Miguel Liu-Schiaffini, Nikola Kovachki, Kamyar Azizzadenesheli, Burigede Liu, Kaushik Bhattacharya, Andrew Stuart, and Anima Anandkumar. Learning chaotic dynamics in dissipative systems. InAdvances in Neural Information Processing Systems, volume 35, pages 16768–16781, 2022

  47. [47]

    Fourier neural operator with learned deformations for PDEs on general geometries.Journal of Machine Learning Research, 24(388):1–26, 2023

    Zongyi Li, Daniel Zhengyu Huang, Burigede Liu, and Anima Anandkumar. Fourier neural operator with learned deformations for PDEs on general geometries.Journal of Machine Learning Research, 24(388):1–26, 2023

  48. [48]

    Spherical Fourier neural operators: Learning stable dynamics on the sphere

    Boris Bonev, Thorsten Kurth, Christian Hundt, Jaideep Pathak, Maximilian Baust, Karthik Kashinath, and Anima Anandkumar. Spherical Fourier neural operators: Learning stable dynamics on the sphere. InInternational Conference on Machine Learning, pages 2806–2823. PMLR, 2023

  49. [49]

    Pope.Turbulent Flows

    Stephen B. Pope.Turbulent Flows. Cambridge University Press, 2000

  50. [50]

    Academic Press, 1952

    Arnold Sommerfeld.Mechanics: Lectures on Theoretical Physics, volume 1. Academic Press, 1952. 12

  51. [51]

    Explorations in Homeomorphic Variational Auto-Encoding

    Luca Falorsi, Pim de Haan, Tim R. Davidson, Nicola De Cao, Maurice Weiler, Patrick Forré, and Taco S. Cohen. Explorations in homeomorphic variational auto-encoding.arXiv preprint arXiv:1807.04689, 2018

  52. [52]

    Bracewell.The Fourier Transform and Its Applications

    Ronald N. Bracewell.The Fourier Transform and Its Applications. McGraw-Hill, New York, 1986

  53. [53]

    Linear convergence of gradient and proximal- gradient methods under the Polyak-Łojasiewicz condition

    Hamed Karimi, Julie Nutini, and Mark Schmidt. Linear convergence of gradient and proximal- gradient methods under the Polyak-Łojasiewicz condition. InJoint European Conference on Machine Learning and Knowledge Discovery in Databases, pages 795–811. Springer, 2016. 13 A Additional methodological details This section gives the definitions and training detai...