Piola-Conditioned Fixed-Reference Neural Operator
Source paper: Shape Holomorphy and Sparse Approximation of the Maxwell Electric Field Integral Operator arXiv:2609.00466 ⓘ · analyzed Sep 2, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Build a geometry-conditioned neural operator on a single reference mesh instead of remeshing or changing the network discretization for every domain shape. Transport vector-valued surface features with a contravariant surface Piola map, and feed the network geometry-dependent pulled-back quantities. This should make the architecture stable across shape changes and allow batching many geometries with identical tensor shapes.
Formulas
Mathematical statement
The paper parameterizes surfaces by \(r_{\mathbf y}(\hat x)=\hat x+\sum_{j\ge1}y_j\psi_j(\hat x)\), with \(\mathbf y\in[-1,1]^{\mathbb N}\), reference surface \(\widehat\Gamma\), deformation modes \(\psi_j\), and amplitudes \(b_j=\|\psi_j\|_{W^{2,\infty}(\widehat\Gamma)}\). A surface contravariant Piola map transports a reference tangential current \(\hat u\) to the deformed surface by \(u(r_{\mathbf y}(\hat x))=J_{\mathbf y}(\hat x)^{-1}D_T r_{\mathbf y}(\hat x)\hat u(\hat x)\), where \(D_T r_{\mathbf y}\) is the tangential derivative and \(J_{\mathbf y}\) is the surface Jacobian. The paper's key structural fact is exact cancellation of surface Jacobian factors in the pulled-back variational formulation. The neural adaptation uses this transport to ensure that vector features represent the same physical type on every geometry rather than coordinate-dependent components.
Implementation notes
(1) Replace the surface or mesh input of a vector neural operator by one fixed reference mesh \(\widehat\Gamma\). For each batch item, provide shape coefficients \(y_1,\ldots,y_K\), compute \(r_{\mathbf y}\), tangential derivatives \(D_T r_{\mathbf y}\), surface Jacobian \(J_{\mathbf y}\), and transformed normals. Apply the Piola map to every vector-valued input feature and inverse-Piola-map the output current or field. Use a mesh graph neural operator, Fourier layer on a parameterized chart, or attention over reference nodes; all batch items then share node and edge indices. (2) Pseudocode: sample \(y\); compute \(r=\hat x+\sum_{j=1}^K y_j\psi_j(\hat x)\); compute \(A=D_T r\) and \(J\); set \(u=J^{-1}A\hat u\); run \(\hat z=F_\theta(\hat x,y,A,J,n,\hat u)\); return \(z=\mathcal P_y\hat z\). For a variational loss, assemble integrands on the reference mesh with transformed features and include the displayed area factor, without an additional geometry-dependent normalization. (3) Compute \(r,A,J\) analytically or by automatic differentiation from the deformation basis; estimate no theorem constants. Monitor whether \(J\) stays positive and reject invalid shapes. (4) First experiment: train a small mesh neural operator on Helmholtz or Maxwell fields over randomly deformed spheres or cubes, comparing this model with a remeshed model and a Cartesian coordinate-conditioned baseline. Measure relative field error, unseen-shape error, batching throughput, and memory. Success is equal accuracy with one shared mesh, at least 2x larger geometry batch size, and smoother error as deformation coefficients vary.
Verification
This idea has not been verified yet.
Verification happens in two stages: Stage 1 — a mechanism check on a toy system confirms the claimed mathematical phenomenon reproduces; Stage 2 — a benchmark implements the idea on a real (small) neural network task and compares it against a tuned baseline over 8 paired seeds with a permutation test.
Artifacts
Artifacts unavailable.