Enforcing boundary conditions for physics-informed neural operators

• URL: http://arxiv.org/abs/2510.24557v1
• Date: Tue, 28 Oct 2025 15:51:48 GMT
• Title: Enforcing boundary conditions for physics-informed neural operators
• Authors: Niklas Göschel, Sebastian Götschel, Daniel Ruprecht,
• Abstract summary: Machine-learning based methods like physics-informed neural networks are becoming increasingly adept at solving even complex systems of partial differential equations.<n> Boundary conditions can be enforced either weakly by penalizing deviations in the loss function or strongly by training a solution structure that inherently matches the prescribed values and derivatives.
• Score: 0.3058685580689604
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Machine-learning based methods like physics-informed neural networks and physics-informed neural operators are becoming increasingly adept at solving even complex systems of partial differential equations. Boundary conditions can be enforced either weakly by penalizing deviations in the loss function or strongly by training a solution structure that inherently matches the prescribed values and derivatives. The former approach is easy to implement but the latter can provide benefits with respect to accuracy and training times. However, previous approaches to strongly enforcing Neumann or Robin boundary conditions require a domain with a fully $C^1$ boundary and, as we demonstrate, can lead to instability if those boundary conditions are posed on a segment of the boundary that is piecewise $C^1$ but only $C^0$ globally. We introduce a generalization of the approach by Sukumar \& Srivastava (doi: 10.1016/j.cma.2021.114333), and a new approach based on orthogonal projections that overcome this limitation. The performance of these new techniques is compared against weakly and semi-weakly enforced boundary conditions for the scalar Darcy flow equation and the stationary Navier-Stokes equations.

Related papers

• 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)
• Single-loop Algorithms for Stochastic Non-convex Optimization with Weakly-Convex Constraints [49.76332265680669]
  This paper examines a crucial subset of problems where both the objective and constraint functions are weakly convex.<n>Existing methods often face limitations, including slow convergence rates or reliance on double-loop designs.<n>We introduce a novel single-loop penalty-based algorithm to overcome these challenges.
  arXiv  Detail & Related papers  (2025-04-21T17:15:48Z)
• Boundary-Decoder network for inverse prediction of capacitor electrostatic analysis [0.49157446832511503]
  We propose an end-to-end deep learning approach to model parameter changes to the boundary conditions.<n>It is shown that our method can significantly outperform both plain vanilla deep learning (NN) and physics informed neural net (PINN) under dynamic boundary condition.
  arXiv  Detail & Related papers  (2024-11-28T05:51:00Z)
• A Neural-preconditioned Poisson Solver for Mixed Dirichlet and Neumann Boundary Conditions [4.180536812092903]
  We introduce a neural-preconditioned iterative solver for Poisson equations with mixed boundary conditions. The key to our preconditioner's success is a novel, lightweight neural network architecture featuring spatially varying convolution kernels.
  arXiv  Detail & Related papers  (2023-09-29T22:49:47Z)
• Neural Fields with Hard Constraints of Arbitrary Differential Order [61.49418682745144]
  We develop a series of approaches for enforcing hard constraints on neural fields. The constraints can be specified as a linear operator applied to the neural field and its derivatives. Our approaches are demonstrated in a wide range of real-world applications.
  arXiv  Detail & Related papers  (2023-06-15T08:33:52Z)
• Convex and Non-convex Optimization Under Generalized Smoothness [69.69521650503431]
  An analysis of convex and non- optimization methods often requires the Lipsitzness gradient, which limits the analysis by this trajectorys. Recent work generalizes the gradient setting via the non-uniform smoothness condition.
  arXiv  Detail & Related papers  (2023-06-02T04:21:59Z)
• Accelerated First-Order Optimization under Nonlinear Constraints [61.98523595657983]
  We exploit between first-order algorithms for constrained optimization and non-smooth systems to design a new class of accelerated first-order algorithms.<n>An important property of these algorithms is that constraints are expressed in terms of velocities instead of sparse variables.
  arXiv  Detail & Related papers  (2023-02-01T08:50:48Z)
• BINN: A deep learning approach for computational mechanics problems based on boundary integral equations [4.397337158619076]
  We proposed the boundary-integral type neural networks (BINN) for the boundary value problems in computational mechanics. The boundary integral equations are employed to transfer all the unknowns to the boundary, then the unknowns are approximated using neural networks and solved through a training process.
  arXiv  Detail & Related papers  (2023-01-11T14:10:23Z)
• A Primal-Dual Approach to Solving Variational Inequalities with General Constraints [54.62996442406718]
  Yang et al. (2023) recently showed how to use first-order gradient methods to solve general variational inequalities. We prove the convergence of this method and show that the gap function of the last iterate of the method decreases at a rate of $O(frac1sqrtK)$ when the operator is $L$-Lipschitz and monotone.
  arXiv  Detail & Related papers  (2022-10-27T17:59:09Z)
• Faster Algorithm and Sharper Analysis for Constrained Markov Decision Process [56.55075925645864]
  The problem of constrained decision process (CMDP) is investigated, where an agent aims to maximize the expected accumulated discounted reward subject to multiple constraints. A new utilities-dual convex approach is proposed with novel integration of three ingredients: regularized policy, dual regularizer, and Nesterov's gradient descent dual. This is the first demonstration that nonconcave CMDP problems can attain the lower bound of $mathcal O (1/epsilon)$ for all complexity optimization subject to convex constraints.
  arXiv  Detail & Related papers  (2021-10-20T02:57:21Z)
• 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)
• Lagrangian Decomposition for Neural Network Verification [148.0448557991349]
  A fundamental component of neural network verification is the computation of bounds on the values their outputs can take. We propose a novel approach based on Lagrangian Decomposition. We show that we obtain bounds comparable with off-the-shelf solvers in a fraction of their running time.
  arXiv  Detail & Related papers  (2020-02-24T17:55:10Z)

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.