The paper introduces a neural operator architecture that inherently satisfies homogeneous Dirichlet boundary conditions by constraining each layer’s output to lie within the span of selected Dirichlet eigenfunctions of the Laplacian. This design works for any bounded domain with a Lipschitz boundary and any discretization, avoiding the restrictions of previous methods. The authors prove universal approximation for their architecture and demonstrate its effectiveness on Darcy flow and Helmholtz equation problems.
By Andrew M. Stuart, Margaret Trautner
arXiv:2608. 11831v1 Announce Type: new Abstract: Learning mappings between infinite-dimensional objects is a central challenge in scientific machine learning.
By Adrien Weihs, Chunyang Liao, Jingmin Sun, Hayden Schaeffer
The paper introduces Spectrally Optimised Neural Discretisations (SpeND), a mesh‑free framework that learns discretisation weights from local stencil geometry on unstructured point clouds. By embedding discrete moment conditions into the network architecture, SpeND guarantees polynomial consistency and allows the weights to be optimised for spectral accuracy over a chosen wavenumber band, using an unsupervised Fourier‑mode loss. The resulting operators are PDE‑agnostic, perform well on Poisson, Burgers, and Navier–Stokes equations, and can reduce wall‑clock time by 3–20× compared to existing mesh‑free methods at the same accuracy.
By Lucas Gerken Starepravo, Henry Broadley, Steven Lind, Jack R. C. King
arXiv:2609.35938v1 Announce Type: new
Abstract: This paper proposes an interpretable neural operator framework, the Kernel Operator Network (KernelOnet), which incorporates kernel functions explicitl...
By Yuan Guo, Hanshu Chen, Qiang Xi, Timon Rabczuk, Zhuojia Fu
The paper studies operator learning on function spaces using encoder–decoder architectures. It shows that as input and output resolutions grow, the induced kernels converge to a limiting kernel, enabling regularity assumptions independent of resolution. The authors derive upper and lower bounds for regularized stochastic gradient descent, extend the analysis to neural networks via the limiting neural tangent kernel, and provide error bounds and complexity guarantees for various kernel and encoding constructions.
By Lei Shi, Jia-Qi Yang, Ding-Xuan Zhou
arXiv:2606. 17513v1 Announce Type: cross Abstract: Neural operators provide fast surrogates for PDEs but their deterministic predictions limit their use in tasks requiring uncertainty quantification (UQ), especially under geometric variability.
By Oriol Vendrell-Gallart, Nima Negarandeh, Ramin Bostanabad