arXiv:2606. 24999v1 Announce Type: new Abstract: High-dimensional partial differential equations (PDEs) with unknown coefficients arise widely in scientific machine learning, including continuous-time reinforcement learning, yet solving them efficiently in a data-driven way remains challenging.
By Yanwei Jia, Du Ouyang, Huy\^en Pham, Xun Yu Zhou
The paper introduces the Frame Kernel Method, a multiscale operator learning approach for surrogate modeling of multiscale partial differential equations. It uses a novel multiscale kernel frame function approximation to cast the learning problem as one of estimating frame coefficients, enabling automatic multiscale decomposition of outputs. The authors provide interpolation proofs, error estimates, and demonstrate that the method outperforms popular neural operators on challenging PDE problems while offering a posteriori multiscale analysis.
By Branden Frieden, Ryan Whitehead, M. Keith Ballard, Robert M. Kirby, Varun Shankar
arXiv:2607. 12570v1 Announce Type: cross Abstract: Multiscale problems are notoriously difficult to tackle using traditional numerical methods, as accurately resolving fine-scale features often requires prohibitively fine discretizations.
By Marc Haltmayer, Jaemin Seo, Yuseung Lee, Sungyeop Lee, Jaehoon Jeong, Jae Yong Lee
The paper introduces two multi-stage neural operator learning frameworks—Deep Collocation Neural Operator (DCNO) and Deep Galerkin Neural Operator (DGNO)—for efficiently computing convolution integrals. DCNO is a supervised method that iteratively refines operator approximations by learning residuals from data pairs, while DGNO is an unsupervised approach that uses the weak form of a PDE residual when the operator can be represented by a PDE. Both frameworks build basis operators across multiple training stages, yielding markedly higher accuracy than one-shot learning and achieving near machine‑precision results for convolution problems, with significant efficiency gains for repeated queries or parametric variations.
By Zhiping Mao, Zhenye Wen, Yong Zhang, Xiaofei Zhao
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
arXiv:2512.12749v3 Announce Type: replace-cross
Abstract: Learning surrogate models for physical systems with latent uncertainty remains challenging in data-scarce regimes: deterministic neural opera...
By Sahil Bhola, Karthik Duraisamy
arXiv:2510. 10350v3 Announce Type: replace-cross Abstract: Operator learning provides a data-driven approach to approximating solution operators of partial differential equations, but its effectiveness depends strongly on how input and output functions are represented.
By Chuqi Chen, Yang Xiang, Weihong Zhang
arXiv:2607. 06287v1 Announce Type: cross Abstract: We study kernel-based operator learning in a two-stage sampling framework, where an offline kernel regression operator learns a discretized representation of the target operator from input-output pairs and an online kernel reconstruction operator recovers the output function from predicted observations.
By R\"udiger Kempf
We study kernel-based operator learning in a two-stage sampling framework, where an offline kernel regression operator learns a discretized representation of the target operator from input-output pairs and an online kernel reconstruction operator recovers the output function from predicted observations. Our main theoretical contribution is an explicit budget allocation condition relating the number $N$ of training pairs, the number $n$ of input observations, and the output resolution $m$.
arXiv:2503. 05598v2 Announce Type: replace-cross Abstract: This review examines neural operator architectures for learning solution operators of parametric partial differential equations (PDEs), with an emphasis on conceptual clarity and practical implementation.
By Prashant K. Jha
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.24049v1 Announce Type: new
Abstract: Neural operators provide efficient surrogates for spatiotemporal PDE systems, but purely data-driven formulations often accumulate substantial errors d...
By Jihao Zhang, Junyi Guo, Jian-Xun Wang