Approximation Theory of Laplacian-Based Neural Operators for Reaction-Diffusion System

• URL: http://arxiv.org/abs/2605.12025v1
• Date: Tue, 12 May 2026 12:13:04 GMT
• Title: Approximation Theory of Laplacian-Based Neural Operators for Reaction-Diffusion System
• Abstract summary: We study neural operators applied to the solution mapping from initial conditions to time-dependent solutions of a generalized Gierer-Meinhardt-diffusion system.<n>Our main results establish explicit approximation error bounds in terms of network depth, width, and spectral rank.<n>We show that Laplacian eigenfunction-based neural architectures alleviate the curse of parametric complexity encountered in generic operator learning.
• Score: 4.86840788259762
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Neural operators provide a framework for learning solution operators of partial differential equations (PDEs), enabling efficient surrogate modeling for complex systems. While universal approximation results are now well understood, approximation analysis specific to nonlinear reaction-diffusion systems remains limited. In this paper, we study neural operators applied to the solution mapping from initial conditions to time-dependent solutions of a generalized Gierer-Meinhardt reaction-diffusion system, a prototypical model of nonlinear pattern formation. Our main results establish explicit approximation error bounds in terms of network depth, width, and spectral rank by exploiting the Laplacian spectral representation of the Green's function underlying the PDE. We show that the required parameter complexity grows at most polynomially with respect to the target accuracy, demonstrating that Laplacian eigenfunction-based neural operator architectures alleviate the curse of parametric complexity encountered in generic operator learning. Numerical experiments on the Gierer-Meinhardt system support the theoretical findings.

Related papers

• Equation Recast for Canonical Operator Learning Across Parametric PDEs [59.44573033543284]
  We introduce equation recast, which reformulates parametric operator learning as the learning of a single canonical operator.<n>In high-fidelity tokamak simulations for nuclear fusion, the framework unifies electron-temperature data across four device geometries.
  arXiv  Detail & Related papers  (2026-09-02T13:15:50Z)
• Influence-Guided Symbolic Regression: Scientific Discovery via LLM-Driven Equation Search with Granular Feedback [56.69850045068714]
  We introduce textitInfluence-Guided Regression (IGSR), a method that frames equation discovery as an iterative two-step process.<n>We demonstrate IGSRs effectiveness on a diverse suite of benchmarks, including LLM-SRBench, pharmacological PKPD models, an epidemiological simulation, and real-world genomic data.
  arXiv  Detail & Related papers  (2026-05-27T23:48:01Z)
• Neural Quantum Spectral Operator Learning for Solving Partial Differential Equations [10.074375064860753]
  Partial differential equations (PDEs) are central to modeling physical and engineering systems.<n>Operator learning enables fast surrogate inference, yet typically requires large input-output paired datasets.<n>We propose a hybrid quantum-classical operator learning framework leveraging the Legendre--Galerkin weak formulation.
  arXiv  Detail & Related papers  (2026-05-12T10:30:14Z)
• Discontinuous Galerkin finite element operator network for solving non-smooth PDEs [15.286345729268149]
  We introduce Discontinuous Galerkin Finite Element Operator Network (DG--FEONet), a data-free operator learning framework.<n>It combines the strengths of the discontinuous Galerkin (DG) method with neural networks to solve parametric partial differential equations.<n>Our results highlight the potential of combining local discretization schemes with machine learning to achieve robust, singularity-aware operator approximation.
  arXiv  Detail & Related papers  (2026-01-07T07:43:30Z)
• MINPO: Memory-Informed Neural Pseudo-Operator to Resolve Nonlocal Spatiotemporal Dynamics [0.0]
  Memory-Informed Pseudo-Operator (MINPO) is a unified framework for modeling nonlocal dynamics.<n>MINPO reconstructs the nonlocal operator and its inverse directly through neural representations, and then explicitly generalizes the unknown solution fields.
  arXiv  Detail & Related papers  (2025-12-19T06:42:16Z)
• Fourier Neural Operators Explained: A Practical Perspective [75.12291469255794]
  The Fourier Neural Operator (FNO) has become the most influential and widely adopted due to its elegant spectral formulation.<n>This guide aims to establish a clear and reliable framework for applying FNOs effectively across diverse scientific and engineering fields.
  arXiv  Detail & Related papers  (2025-12-01T08:56:21Z)
• DimINO: Dimension-Informed Neural Operator Learning [41.37905663176428]
  DimINO is a framework inspired by dimensional analysis.<n>It can be seamlessly integrated into existing neural operator architectures.<n>It achieves up to 76.3% performance gain on PDE datasets.
  arXiv  Detail & Related papers  (2024-10-08T10:48:50Z)
• Disentangled Representation Learning for Parametric Partial Differential Equations [31.240283037552427]
  We propose a new paradigm for learning disentangled representations from neural operator parameters. DisentangO is a novel hyper-neural operator architecture designed to unveil and disentangle the latent physical factors of variation embedded within the black-box neural operator parameters. We show that DisentangO effectively extracts meaningful and interpretable latent features, bridging the divide between predictive performance and physical understanding in neural operator frameworks.
  arXiv  Detail & Related papers  (2024-10-03T01:40:39Z)
• Linearization Turns Neural Operators into Function-Valued Gaussian Processes [23.85470417458593]
  We introduce LUNO, a novel framework for approximate Bayesian uncertainty quantification in trained neural operators.<n>Our approach leverages model linearization to push (Gaussian) weight-space uncertainty forward to the neural operator's predictions.<n>We show that this can be interpreted as a probabilistic version of the concept of currying from functional programming, yielding a function-valued (Gaussian) random process belief.
  arXiv  Detail & Related papers  (2024-06-07T16:43:54Z)
• Generalized Neural Closure Models with Interpretability [28.269731698116257]
  We develop a novel and versatile methodology of unified neural partial delay differential equations. We augment existing/low-fidelity dynamical models directly in their partial differential equation (PDE) forms with both Markovian and non-Markovian neural network (NN) closure parameterizations. We demonstrate the new generalized neural closure models (gnCMs) framework using four sets of experiments based on advecting nonlinear waves, shocks, and ocean acidification models.
  arXiv  Detail & Related papers  (2023-01-15T21:57:43Z)
• Fractal Structure and Generalization Properties of Stochastic Optimization Algorithms [71.62575565990502]
  We prove that the generalization error of an optimization algorithm can be bounded on the complexity' of the fractal structure that underlies its generalization measure. We further specialize our results to specific problems (e.g., linear/logistic regression, one hidden/layered neural networks) and algorithms.
  arXiv  Detail & Related papers  (2021-06-09T08:05:36Z)
• Provably Efficient Neural Estimation of Structural Equation Model: An Adversarial Approach [144.21892195917758]
  We study estimation in a class of generalized Structural equation models (SEMs) We formulate the linear operator equation as a min-max game, where both players are parameterized by neural networks (NNs), and learn the parameters of these neural networks using a gradient descent. For the first time we provide a tractable estimation procedure for SEMs based on NNs with provable convergence and without the need for sample splitting.
  arXiv  Detail & Related papers  (2020-07-02T17:55:47Z)
• Multipole Graph Neural Operator for Parametric Partial Differential Equations [57.90284928158383]
  One of the main challenges in using deep learning-based methods for simulating physical systems is formulating physics-based data. We propose a novel multi-level graph neural network framework that captures interaction at all ranges with only linear complexity. Experiments confirm our multi-graph network learns discretization-invariant solution operators to PDEs and can be evaluated in linear time.
  arXiv  Detail & Related papers  (2020-06-16T21:56:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.