Enforcing Dirichlet Boundary Conditions in Operator Learning

• URL: http://arxiv.org/abs/2608.27256v1
• Date: Thu, 27 Aug 2026 15:40:29 GMT
• Title: Enforcing Dirichlet Boundary Conditions in Operator Learning
• Abstract summary: We propose an architecture which satisfies homogeneous Dirichlet boundary conditions.<n>We prove universal approximation for the resulting architecture.<n>We also prove for a broad class of kernel-integral neural operators.
• Score: 1.6615337656760854
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Operator learning in scientific machine learning is concerned with approximation of maps between infinite-dimensional function spaces; such maps frequently arise as the solution operators of partial differential equations (PDEs). Neural operators have demonstrated broad empirical success at approximating such maps from data. However, most existing neural operator architectures enforce boundary conditions indirectly through training from data even though the boundary condition is often known exactly. Furthermore, existing modifications and approaches that do enforce boundary conditions explicitly suffer from impractical restrictions, including boundary smoothness, uniform grids, and separable, box-like domains. In this work, we propose an architecture which, independently of training, satisfies homogeneous Dirichlet boundary conditions, whilst simultaneously retaining the expressivity of existing kernel-integral neural operator architectures. This is achieved by enforcing the property that the output of each layer is contained in the span of a subset of the homogeneous Dirichlet eigenfunctions of the Laplacian on the output domain. The method requires only that the output domain be bounded with Lipschitz boundary and places no restriction on the choice of discretization, making it applicable to arbitrary mesh data and general geometries. We prove universal approximation for the resulting architecture; furthermore the approach we adopt in the analysis proves universality for a broad class of kernel-integral neural operators thereby uniting existing theory for a variety of operator learning methods. We validate the proposed method on maps defined by the coefficient to solution map in 2D PDEs: Darcy flow on a square domain and the Helmholtz equation on a circular domain. Comparisons are made with alternative methods.

Related papers

• Domain-Decomposed Randomized Neural Networks for Partial Differential Equations in Unbounded Domains [5.423324761643612]
  Partial differential equations on unbounded domains are challenging because the exterior region must be represented without excessive truncation error.<n>We propose a domain-decomposed randomized neural network framework for such problems.
  arXiv  Detail & Related papers  (2026-06-30T08:41:54Z)
• GRIFDIR: Graph Resolution-Invariant FEM Diffusion Models in Function Spaces over Irregular Domains [56.121725064621295]
  Score-based diffusion models in function spaces offer a principled framework for modelling function-valued data.<n>However, practical implementations have struggled to fully realise these benefits.<n>We propose a novel architecture that represents generalised convolutional kernels as finite graph kernels.
  arXiv  Detail & Related papers  (2026-05-05T08:33:52Z)
• Explicit Block Encodings of Discrete Laplacians with Mixed Boundary Conditions [45.88028371034407]
  Block encoding provides the standard method for accessing matrix data within quantum circuits.<n>We present a unified framework for efficiently block encoding finite-difference discretizations of the Laplacian.
  arXiv  Detail & Related papers  (2026-03-12T19:35:16Z)
• One Operator to Rule Them All? On Boundary-Indexed Operator Families in Neural PDE Solvers [0.0]
  We show that standard neural operator training implicitly learns a boundary-indexed family of operators, rather than a single boundary-agnostic operator.<n>We formalize this perspective by framing operator learning as conditional risk minimization over boundary conditions.
  arXiv  Detail & Related papers  (2026-03-02T03:15:00Z)
• Operator learning on domain boundary through combining fundamental solution-based artificial data and boundary integral techniques [7.3529349900185395]
  For linear partial differential equations with known fundamental solutions, this work introduces a novel operator learning framework.<n>It relies exclusively on domain boundary data, including solution values and normal derivatives, rather than full-domain sampling.<n>We refer to this approach as the Mathematical Artificial Data Boundary Neural Operator (MAD-BNO), which learns boundary-to-boundary mappings.
  arXiv  Detail & Related papers  (2026-01-16T12:00:52Z)
• Learning the boundary-to-domain mapping using Lifting Product Fourier Neural Operators for partial differential equations [5.5927988408828755]
  We present a novel FNO-based architecture, named Lifting Product FNO (or LP-FNO) which can map arbitrary boundary functions to a solution in the entire domain. We demonstrate the efficacy and resolution independence of the proposed LP-FNO for the 2D Poisson equation.
  arXiv  Detail & Related papers  (2024-06-24T15:45:37Z)
• Neural Operators with Localized Integral and Differential Kernels [77.76991758980003]
  We present a principled approach to operator learning that can capture local features under two frameworks. We prove that we obtain differential operators under an appropriate scaling of the kernel values of CNNs. To obtain local integral operators, we utilize suitable basis representations for the kernels based on discrete-continuous convolutions.
  arXiv  Detail & Related papers  (2024-02-26T18:59:31Z)
• Neural and spectral operator surrogates: unified construction and expression rate bounds [0.46040036610482665]
  We study approximation rates for deep surrogates of maps between infinite-dimensional function spaces. Operator in- and outputs from function spaces are assumed to be parametrized by stable, affine representation systems.
  arXiv  Detail & Related papers  (2022-07-11T15:35:14Z)
• Partial Counterfactual Identification from Observational and Experimental Data [83.798237968683]
  We develop effective Monte Carlo algorithms to approximate the optimal bounds from an arbitrary combination of observational and experimental data. Our algorithms are validated extensively on synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2021-10-12T02:21:30Z)
• Exact imposition of boundary conditions with distance functions in physics-informed deep neural networks [0.5804039129951741]
  We introduce geometry-aware trial functions in artifical neural networks to improve the training in deep learning for partial differential equations. To exactly impose homogeneous Dirichlet boundary conditions, the trial function is taken as $phi$ multiplied by the PINN approximation. We present numerical solutions for linear and nonlinear boundary-value problems over domains with affine and curved boundaries.
  arXiv  Detail & Related papers  (2021-04-17T03:02:52Z)
• Optimal oracle inequalities for solving projected fixed-point equations [53.31620399640334]
  We study methods that use a collection of random observations to compute approximate solutions by searching over a known low-dimensional subspace of the Hilbert space. We show how our results precisely characterize the error of a class of temporal difference learning methods for the policy evaluation problem with linear function approximation.
  arXiv  Detail & Related papers  (2020-12-09T20:19:32Z)
• 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)
• Neural Operator: Graph Kernel Network for Partial Differential Equations [57.90284928158383]
  This work is to generalize neural networks so that they can learn mappings between infinite-dimensional spaces (operators) We formulate approximation of the infinite-dimensional mapping by composing nonlinear activation functions and a class of integral operators. Experiments confirm that the proposed graph kernel network does have the desired properties and show competitive performance compared to the state of the art solvers.
  arXiv  Detail & Related papers  (2020-03-07T01:56:20Z)

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.