Pith. sign in

REVIEW 3 major objections 5 minor 32 references

The paper shows that a frozen library of neural mechanism blocks, trained once on a regular domain, can be reused on unseen geometries through a boundary-adapted coordinate change, so that geometry and boundary conditions only alter an alge

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 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · deepseek-v4-flash

2026-08-01 03:41 UTC pith:4B44JMKW

load-bearing objection A useful geometry-transfer layer for reusable neural PDE blocks, with broad empirical support; the transfer guarantee is tested rather than proved, and the parent LegONet paper remains unpublished. the 3 major comments →

arxiv 2607.23069 v1 pith:4B44JMKW submitted 2026-07-25 math.NA cs.NA

Geometry-aware LegONet for PDE Learning on Arbitrary Domains

Jiahao Zhang , Yueqi Wang , Guang Lin This is my paper
classification math.NA cs.NA MSC 65M7065M6068T0735K55
keywords geometry-aware operator learningboundary-adapted coordinatesneural mechanism blocksPDE learningphysical-law discoveryGalerkin projectiontransfer without retrainingmodular operator learning
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

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

The paper introduces gLegONet, which claims that a library of neural operator blocks—trained once on a regular square domain—can be reused unchanged on arbitrary new geometries and boundary conditions, with only an algebraic coordinate layer changing. Boundary constraints are built into the state coordinates by computing the null space of sampled boundary constraints and mass-orthonormalizing against the domain's L2 metric, so the reduced dynamics evolve in boundary-admissible coordinates and satisfy the boundary to round-off rather than via penalty terms. The same frozen blocks are shown to support both forward simulation and sparse-law discovery on unseen domains, without retraining or target-domain trajectories. If true, this turns arbitrary-domain PDE learning from per-geometry retraining into modular assembly over reusable physical mechanisms, and makes physical-law discovery geometry-independent.

Core claim

The central claim is that the entanglement between learned physics and geometry in neural PDE solvers can be cut by a deterministic coordinate change. A pretrained ambient library B_Q^θ = {F_i^θ} on the ambient square is frozen; for a target domain Ω, boundary samples define an affine admissible manifold a(t) = a_bc(t) + N_Ω z(t), where N_Ω is a mass-orthonormal basis of the boundary-homogeneous directions (N_Ωᵀ M_Ω N_Ω = I). Each frozen block is realized on Ω through its reduced Galerkin response q_i^Ω(z,t) = N_Ωᵀ M_Ω F_i^θ(a_bc + N_Ω z), and the dynamics are ẏ = Σ_i c_i q_i^Ω − N_Ωᵀ M_Ω ȧ_bc. Thus geometry and boundary conditions change only the algebraic layer (C, a_bc, N_Ω, M_Ω), while t

What carries the argument

The boundary-adapted coordinate matrix N_Ω is the load-bearing object: it is built from the null space of the sampled boundary constraint matrix C (via SVD), then mass-normalized so that N_Ωᵀ M_Ω N_Ω = I. This matrix converts each frozen ambient block into a reduced Galerkin response q_i^Ω = N_Ωᵀ M_Ω F_i^θ(a_bc + N_Ω z), making the boundary condition an algebraic property of the coordinates. The same machinery supplies the feature space for law discovery: candidate mechanisms are realized through the same reduced response and regressed in the boundary-adapted coordinate z.

Load-bearing premise

A mechanism block trained to approximate a differential operator on unconstrained ambient coefficients remains accurate when evaluated at the restricted, boundary-adapted states used on a new domain; if this state-space transfer fails, the reduced response is not the true Galerkin projection of the target mechanism.

What would settle it

Evaluate the Galerkin projection residual N_Ωᵀ M_Ω [F_θ(a_bc + N_Ω z) − F_i(a_bc + N_Ω z)] over admissible states on a domain whose boundary features lie near or beyond the ambient Fourier cutoff K. The central claim predicts this residual stays near the ambient training error; if it rises to the order of the mechanism itself on such a domain, the frozen-block transfer premise fails.

Watch this falsifier. Get emailed when new claim-graph text bears on it.

If this is right

  • A single pretrained mechanism library can be reused for forward simulation on new domains, boundary types, and mixed constraints, with boundary residuals near machine precision instead of penalty losses.
  • Higher-order operators, such as the clamped biharmonic Swift–Hohenberg term, can be composed from lower-order frozen blocks inside the boundary-adapted space, so no high-order block needs to be trained.
  • The boundary-adapted coordinates provide a stable feature space for sparse law identification, recovering governing coefficients from short-time observations on unseen domains where finite-difference derivatives are unstable.
  • Because boundary enforcement is algebraic, remaining rollout error is explicitly attributable to ambient resolution, retained rank, block accuracy, and time integration—not boundary leakage—which redirects where improvements should focus.

Where Pith is reading between the lines

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

  • If the transfer premise holds, the method implies a new unit of reusable scientific software: mechanism blocks pretrained on a reference domain and deployed on arbitrary geometries by solving a single linear algebra problem (null-space and mass-normalization), making geometry handling in learned PDE solvers as routine as mesh generation in classical codes.
  • The boundary-coordinate construction is not tied to the Fourier basis; any approximation-complete trial family (finite-element, wavelet, polynomial) could serve as the ambient baseplate. A testable extension is to substitute such a basis and check whether the transfer properties persist.
  • The observed sensitivity to the gap between the target domain and the ambient boundary (the paper's Fig. 4d) suggests a practical deployment guideline: keep target domains well inside the ambient square, and choose the ambient cutoff K to resolve the smallest boundary feature; handling tightly fitting domains would likely require a different ambient basis or adaptive refinement.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper proposes Geometry-aware LegONet (gLegONet), a method for reusing pretrained, frozen neural "mechanism blocks" (diffusion, transport, reaction) across arbitrary embedded domains. Physical mechanisms are pretrained once on an ambient square Q using Fourier coefficients. For a target domain Ω, sampled boundary conditions define an affine admissible set a(t)=a_bc(t)+N_Ω z(t), where N_Ω is a mass-orthonormal null-space basis. Frozen blocks are evaluated at such admissible states and their responses are Galerkin-projected onto the boundary-adapted coordinates, giving the reduced dynamics of Eq. (5). The paper claims that changing the domain changes only the algebraic realization layer (C, a_bc, N_Ω, M_Ω), not the learned operator blocks. This is tested on manufactured-solution benchmarks with Dirichlet, Neumann, Robin, mixed and clamped conditions; on Allen–Cahn, vector Burgers, Navier–Stokes cylinder wake and Swift–Hohenberg; and on sparse law identification from short-time data. Comparisons are made against PINN, FNO, UNO, finite-element/finite-volume references, and finite-difference baselines.

Significance. If the central transfer property holds, the paper offers a genuinely useful separation: learned physical mechanisms are amortized once in a geometry-free ambient space, while boundary conditions and geometry are imposed deterministically through an algebraic interface. The experiments are substantial and use independent references (manufactured exact solutions, FEM, finite volume), report boundary residuals and rank/sampling ablations, and provide code/data links. The forward tests are not circular: they use held-out domains, boundary conditions and reference solvers. The inverse discovery tests also appear to be genuine extrapolation, with identification on a short window and rollout 80 times longer. However, the paper's central claim rests on an unproved assumption about the behavior of frozen blocks on boundary-adapted coefficient states; the current evidence, while suggestive, does not isolate that assumption from other error sources. The manuscript also defers the key stability/error argument to a Supplementary Information not included in the submitted text.

major comments (3)
  1. [Methods, 'Galerkin realization and rollout of frozen blocks', Eq. (4)] The central identity q_i^Ω(z,t)=N_Ω^T M_Ω F_i^θ(a_bc(t)+N_Ω z) is not, by itself, a Galerkin projection of the target-domain mechanism L_i^Ω. F_i^θ is trained to approximate P_Q L_i^Q(R_Q a), where P_Q is the L^2(Q) Fourier projection over the whole ambient square. For any differential operator, the values of L_i^Q(R_Q a) on Q\Ω enter F_i^θ(a). The boundary null-space construction selects a specific extension of the target field to Q\Ω, but no argument is given that the frozen block is accurate on that extension, or that the outside-Ω contribution vanishes after multiplication by N_Ω^T M_Ω. The Fourier coefficients are global, so this cancellation is not automatic. If F_i^θ is inaccurate at the boundary-adapted states, then q_i^Ω is not the target mechanism response and Eq. (5) advances a different reduced ODE. This is load-bearing for the paper's main claim. I recommend adding a direct
  2. [Methods, Algorithm 1 and Discussion] The manuscript states that 'A standard stability argument decomposes the resulting error into boundary-adapted approximation, mechanism-response mismatch and time-discretization terms; see Supplementary Information.' The Supplementary Information is not provided with the submitted manuscript, so this claim cannot be checked. More importantly, the Discussion lists 'accuracy of the pretrained blocks' as an error source but does not identify the extension-dependence highlighted above. Since the entire geometry-independence claim collapses if Eq. (4) is not a faithful Galerkin realization of the target operator, the stability argument or an explicit assumption with numerical validation must appear in the main text. Without it, the 'geometry changes only the algebraic layer' claim is asserted rather than demonstrated.
  3. [Methods, Eq. (7) and Algorithm 2] The inverse discovery claim depends on the accuracy of temporal derivatives ẑ_n estimated from a short trajectory (T_id=0.012) after solving the per-observation least-squares problem (6). The sensitivity of ẑ_n to sensor noise, sensor placement and the conditioning of Φ_obs is not analyzed. The numerical ablations show degradation with noise, but a theoretical or systematic conditioning study would support the claim that the method 'turns sparse observations into predictive laws'. This is secondary to the main geometry-transfer claim, but it is a stated contribution and should be addressed.
minor comments (5)
  1. [Methods, 'Boundary-adapted coordinates on target domains'] Notation: M_Ω is used both for the mass matrix and, in the same paragraph, 'whereas N_Ω below denotes the boundary-adapted coordinate matrix'. The sentence is understandable but could be clearer. Also, the affine lift a_bc(t) is not unique; the text should state explicitly that the reduced state z reparametrizes the same admissible set and that the final evolution is independent of the chosen lift.
  2. [Fig. 2, Extended Data Table 2] The FNO and UNO baselines are trained on nearby manufactured families (Extended Data Table 2) rather than on the target geometry/family. This is a reasonable baseline choice for a zero-shot transfer claim, but the figure captions should state this clearly in the main text; otherwise a reader may misinterpret the comparison as FNO/UNO being trained on the same target.
  3. [Results, 'Sparse physical-law discovery on unseen domains'] The text reports e_coef=6.89e-5 for the peanut zero-noise case but the table entry includes a standard deviation. Please make the reporting consistent: give the mean±std in the text or state that the quoted value is a single-seed illustrative run.
  4. [References] Reference [21] (LegONet) is central to the proposed framework but is listed as 'manuscript under review'. If it is not publicly available, the paper should include sufficient details of the block training procedure and generator-form notation in the main text or an appendix so that the present work is self-contained.
  5. [Additional information] There is a missing space in 'Correspondence and requests for materialsshould be addressed'. Also, the phrase 'boundary-guaranteed assembly' in the Abstract is stronger than what is demonstrated, since the boundary condition is enforced only at sampled boundary points to numerical rank tolerance; the paper later reports dense residual checks, so please qualify the abstract wording accordingly.

Circularity Check

0 steps flagged

No significant circularity: the central geometry-transfer claim is validated against independent references, and the only self-citation (to LegONet) is not load-bearing.

full rationale

The paper's central claimed derivation is Eq. (4)–(5): the target-domain reduced response is defined as q_i^Ω(z,t)=N_Ω^T M_Ω F_i^θ(a_bc(t)+N_Ω z), and the rollout is z-dot = Σ c_i q_i^Ω − N_Ω^T M_Ω a_bc-dot. These are algebraic projections of the frozen ambient block, not predictions fitted to the target data. The forward experiments compare against independent manufactured solutions, FEM references, finite-volume references, and neural baselines; the boundary-adapted construction is an input, not a fitted result. The law-discovery experiments fit coefficients only on T_id=0.012 and roll out to T_roll=1.0, which is a genuine time extrapolation rather than a restatement of the fit. The boundary-residual reports are by-construction consequences of C N_Ω≈0 and a=a_bc+N_Ω z, and the paper acknowledges this; the real validation is field error against independent references. The main self-citation is ref. [21], an unpublished same-author manuscript, used for the generator-form block template and for the direct inner-square control; since the blocks are retrained and independently tested in this paper, this citation is not load-bearing for the central claim. The stability argument is deferred to Supplementary Information and is not in the submitted text; that is an omitted proof for the error decomposition, but it is not circularity. No prediction or derived result is equivalent to its inputs by construction.

Axiom & Free-Parameter Ledger

5 free parameters · 5 axioms · 0 invented entities

The ledger is clean in the physics sense: no new particles, forces, or conserved quantities are invented. The free parameters are standard numerical discretization and regression hyperparameters (K, r, N_b, thresholds). The nontrivial assumption is the empirical transfer of frozen learned blocks to boundary-adapted states; this is the weakest point of the paper.

free parameters (5)
  • Fourier cutoff K = 22 default; 30, 45 in stress tests
    Hand-chosen ambient spectral resolution. Experiments show boundary accuracy saturates while interior error improves with K.
  • Retained coordinate rank r = 207–833 in forward tests; 80 in discovery tests
    Truncation of the mass-orthonormalized nullspace. The paper's ablations show r is the dominant accuracy limiter.
  • Boundary sample count N_b = 420–1600 depending on test
    Number of trace points used to build C. The paper shows weak sensitivity once the boundary trace is resolved.
  • Nullspace thresholds τ_C, τ_M = τ_C=10⁻¹⁰, τ_M=10⁻¹¹
    Hand-set singular/eigenvalue thresholds for the numerical nullspace and mass-orthonormalization.
  • Sparse regression hyperparameters = λ_ridge and threshold-refit settings specified in SI
    Controls the coefficient recovery in Eq. (7); exact values are not in the main text.
axioms (5)
  • standard math Truncated real Fourier basis is dense in L²(Q), so restricting the ambient Fourier representation to Ω can approximate target fields.
    Invoked in Methods 'Ambient representation' via density of Fourier basis in L².
  • domain assumption The target-domain mechanism L_Ω^i is the restriction of an ambient operator L_Q^i, and the PDE decomposes additively as Σ c_i L_i^Ω(u).
    Used throughout the formulation; valid for the tested scalar constant-coefficient mechanisms on affinely embedded domains, but not for arbitrary geometry-dependent or nonlocal mechanisms.
  • ad hoc to paper A frozen block F_θ trained on Q remains accurate when evaluated at the boundary-adapted coefficient states a_bc + N_Ω z arising on a new target domain.
    This is the load-bearing transfer assumption. It enters at Eq. (4) and is validated empirically rather than proven.
  • domain assumption A finite set of boundary samples and the SVD nullspace of C correctly represent the true boundary-admissible manifold.
    Used in Eqs. (1)–(3). Dense boundary residual checks support this for the tested smooth geometries.
  • standard math The volume quadrature M_Ω = Φ_Ωᵀ W_Ω Φ_Ω accurately represents the L²(Ω) inner product.
    Required for the Galerkin projections in Eqs. (4)–(5).

pith-pipeline@v1.3.0-alltime-deepseek · 3642 in / 3622 out tokens · 159923 ms · 2026-08-01T03:41:24.593474+00:00 · methodology

0 comments
read the original abstract

Learned PDE solvers often entangle governing operators with the geometry, boundary conditions, and discretization used for training. This limits reuse when the same physics is posed on new domains, and it also makes physical-law discovery geometry-dependent. We introduce Geometry-aware LegONet (gLegONet), a boundary-manifold extension of Lego-like operator learning. Physical mechanisms are pretrained once as modular variational blocks on an ambient spectral domain. For a target geometry, sampled boundary constraints define an affine admissible manifold. Its mass-orthonormal tangent coordinates are used to evolve the dynamics and evaluate candidate law-discovery features directly. Changing the domain therefore changes only an algebraic coordinate interface, not the learned operator blocks. This converts arbitrary-domain PDE learning from geometry-specific retraining or soft penalty enforcement into boundary-guaranteed assembly of reusable mechanisms. In forward simulations and sparse identification tests on unseen domains, the method maintains boundary residuals near the algebraic tolerance and yields predictive governing laws from short-time observations.

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

32 extracted references · 4 linked inside Pith

  1. [1]

    & Spiliopoulos, K

    Sirignano, J. & Spiliopoulos, K. DGM: A deep learning algorithm for solving partial differential equations.Journal of Computational Physics375, 1339–1364 (2018)

    2018

  2. [2]

    & Karniadakis, G

    Raissi, M., Perdikaris, P. & Karniadakis, G. E. Physics-informed neural networks: A deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations.Journal of Computational Physics378, 686–707 (2019)

    2019

  3. [3]

    & Karniadakis, G

    Lu, L., Jin, P., Pang, G., Zhang, Z. & Karniadakis, G. E. Learning nonlinear oper- ators via DeepONet based on the universal approximation theorem of operators. Nature Machine Intelligence3, 218–229 (2021)

    2021

  4. [4]

    arXiv preprint arXiv:2010.08895(2020)

    Li, Z.et al.Fourier Neural Operator for Parametric Partial Differential Equations. arXiv preprint arXiv:2010.08895(2020)

    Pith/arXiv arXiv 2010

  5. [5]

    Kovachki, N.et al.Neural operator: Learning maps between function spaces with applications to PDEs.Journal of Machine Learning Research24, 1–97 (2023)

    2023

  6. [6]

    & Battaglia, P

    Pfaff, T., Fortunato, M., Sanchez-Gonzalez, A. & Battaglia, P. W. Learning mesh- based simulation with graph networks.International Conference on Learning Representations(2021)

    2021

  7. [7]

    J.Finite Difference Methods for Ordinary and Partial Differential Equations(SIAM, Philadelphia, PA, 2007)

    LeVeque, R. J.Finite Difference Methods for Ordinary and Partial Differential Equations(SIAM, Philadelphia, PA, 2007)

    2007

  8. [8]

    Brenner, S. C. & Scott, L. R.The Mathematical Theory of Finite Element Methods(Springer, New York, NY, 2008)

    2008

  9. [9]

    P.Chebyshev and Fourier Spectral MethodsSecond edn (Dover Publications, Mineola, NY, 2001)

    Boyd, J. P.Chebyshev and Fourier Spectral MethodsSecond edn (Dover Publications, Mineola, NY, 2001)

    2001

  10. [10]

    E.et al.Physics-informed machine learning.Nature Reviews Physics3, 422–440 (2021)

    Karniadakis, G. E.et al.Physics-informed machine learning.Nature Reviews Physics3, 422–440 (2021)

    2021

  11. [11]

    & Srivastava, A

    Sukumar, N. & Srivastava, A. Exact imposition of boundary conditions with distance functions in physics-informed deep neural networks.Computer Methods in Applied Mechanics and Engineering389, 114333 (2022)

    2022

  12. [12]

    A., Ross, Z

    Rahman, M. A., Ross, Z. E. & Azizzadenesheli, K. U-NO: U-shaped Neural Operators.Transactions on Machine Learning Research(2023)

    2023

  13. [13]

    Z., Liu, B

    Li, Z., Huang, D. Z., Liu, B. & Anandkumar, A. Fourier neural operator with learned deformations for PDEs on general geometries.Journal of Machine Learning Research24, 1–26 (2023). 26

    2023

  14. [14]

    Liu, N., Jafarzadeh, S. & Yu, Y. Domain agnostic fourier neural operators. Advances in neural information processing systems36, 47438–47450 (2023)

    2023

  15. [15]

    Advances in Neural Information Processing Systems36, 35836–35854 (2023)

    Li, Z.et al.Geometry-informed neural operator for large-scale 3D PDEs. Advances in Neural Information Processing Systems36, 35836–35854 (2023)

    2023

  16. [16]

    Proceedings of Machine Learning Research202, 12556–12569 (2023)

    Hao, Z.et al.GNOT: A general neural operator transformer for operator learning. Proceedings of Machine Learning Research202, 12556–12569 (2023)

    2023

  17. [17]

    & Long, M

    Wu, H., Luo, H., Wang, H., Wang, J. & Long, M. Transolver: A fast transformer solver for pdes on general geometries.arXiv preprint arXiv:2402.02366(2024)

    Pith/arXiv arXiv 2024

  18. [18]

    & Meidani, H

    Zhong, W. & Meidani, H. Physics-informed geometry-aware neural operator. Computer Methods in Applied Mechanics and Engineering434, 117540 (2025)

    2025

  19. [19]

    Wang, H., Li, J., Dwivedi, A., Hara, K. & Wu, T. BENO: Boundary-embedded neural operators for elliptic pdes.arXiv preprint arXiv:2401.09323(2024)

    Pith/arXiv arXiv 2024

  20. [20]

    & De Lorenzis, L

    Mousavi, S., Mishra, S. & De Lorenzis, L. Imposing Boundary Conditions on Neu- ral Operators via Learned Function Extensions.arXiv preprint arXiv:2602.04923 (2026)

    Pith/arXiv arXiv 2026

  21. [21]

    & Lin, G

    Zhang, J., Wang, Y. & Lin, G. LegONet: Plug-and-play structure-preserving neural operator blocks for compositional PDE learning.manuscript under review (2026)

    2026

  22. [22]

    On the construction and comparison of difference schemes.SIAM Journal on Numerical Analysis5, 506–517 (1968)

    Strang, G. On the construction and comparison of difference schemes.SIAM Journal on Numerical Analysis5, 506–517 (1968)

    1968

  23. [23]

    & Wanner, G.Geometric Numerical Integration(Springer, New York, NY, 2006)

    Hairer, E., Lubich, C. & Wanner, G.Geometric Numerical Integration(Springer, New York, NY, 2006)

    2006

  24. [24]

    L., Proctor, J

    Brunton, S. L., Proctor, J. L. & Kutz, J. N. Discovering governing equations from data by sparse identification of nonlinear dynamical systems.Proceedings of the national academy of sciences113, 3932–3937 (2016)

    2016

  25. [25]

    H., Brunton, S

    Rudy, S. H., Brunton, S. L., Proctor, J. L. & Kutz, J. N. Data-driven discovery of partial differential equations.Science advances3, e1602614 (2017)

    2017

  26. [26]

    Messenger, D. A. & Bortz, D. M. Weak SINDy for partial differential equations. Journal of Computational Physics443, 110525 (2021)

    2021

  27. [27]

    N.Spectral methods in MATLAB(SIAM, Philadelphia, PA, 2000)

    Trefethen, L. N.Spectral methods in MATLAB(SIAM, Philadelphia, PA, 2000)

    2000

  28. [28]

    Y., Quarteroni, A

    Canuto, C., Hussaini, M. Y., Quarteroni, A. & Zang, T. A.Spectral methodsVol. 285 (Springer, New York, NY, 2006). 27

    2006

  29. [29]

    32 (Elsevier, Amsterdam, 2003)

    Cohen, A.Numerical analysis of wavelet methodsVol. 32 (Elsevier, Amsterdam, 2003)

    2003

  30. [30]

    Golub, G. H. & Van Loan, C. F.Matrix computations(JHU press, Baltimore, MD, 2013)

    2013

  31. [31]

    Trefethen, L. N. & Bau, D.Numerical linear algebra(SIAM, Philadelphia, PA, 2022)

    2022

  32. [32]

    Regression shrinkage and selection via the lasso.Journal of the Royal Statistical Society Series B: Statistical Methodology58, 267–288 (1996)

    Tibshirani, R. Regression shrinkage and selection via the lasso.Journal of the Royal Statistical Society Series B: Statistical Methodology58, 267–288 (1996). 28 Extended Data (a)Transport primitive derivative. (b)Laplacian coefficient output. Extended Data Fig. 1Held-out diagnostics for the reusable ambient blocks. The left panel reports the relative erro...

    1996