An optimal Petrov-Galerkin framework for operator networks

• URL: http://arxiv.org/abs/2503.04024v1
• Date: Thu, 06 Mar 2025 02:21:32 GMT
• Title: An optimal Petrov-Galerkin framework for operator networks
• Abstract summary: We propose an operator network framework called Petrov-Galerkin Variationally Mimetic Operator Network (PG-VarMiON)<n>The PG-VarMiON is trained in a supervised manner using a labeled dataset comprising the PDE data and the corresponding PDE solution.<n>We derive approximation error estimates for PG-VarMiON, highlighting the contributions of various error sources.
• Score: 6.74215163873406
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The optimal Petrov-Galerkin formulation to solve partial differential equations (PDEs) recovers the best approximation in a specified finite-dimensional (trial) space with respect to a suitable norm. However, the recovery of this optimal solution is contingent on being able to construct the optimal weighting functions associated with the trial basis. While explicit constructions are available for simple one- and two-dimensional problems, such constructions for a general multidimensional problem remain elusive. In the present work, we revisit the optimal Petrov-Galerkin formulation through the lens of deep learning. We propose an operator network framework called Petrov-Galerkin Variationally Mimetic Operator Network (PG-VarMiON), which emulates the optimal Petrov-Galerkin weak form of the underlying PDE. The PG-VarMiON is trained in a supervised manner using a labeled dataset comprising the PDE data and the corresponding PDE solution, with the training loss depending on the choice of the optimal norm. The special architecture of the PG-VarMiON allows it to implicitly learn the optimal weighting functions, thus endowing the proposed operator network with the ability to generalize well beyond the training set. We derive approximation error estimates for PG-VarMiON, highlighting the contributions of various error sources, particularly the error in learning the true weighting functions. Several numerical results are presented for the advection-diffusion equation to demonstrate the efficacy of the proposed method. By embedding the Petrov-Galerkin structure into the network architecture, PG-VarMiON exhibits greater robustness and improved generalization compared to other popular deep operator frameworks, particularly when the training data is limited.

Related papers

• PG-KINN: A Physics-Informed Petrov-Galerkin Kolmogorov-Arnold Network for Solving Forward and Inverse PDEs [0.33585724475660284]
  Physics-informed learning of partial differential equations (PDEs) has been dominated by multilayer perceptrons (MLPs)<n> Kolmogorov Arnold Networks (KANs) mitigate these limitations because their learnable activations are structurally aligned with the classical discretizations.<n>We present PG-KINN, a physics-informed KAN built on a Petrov-Galerkin formulation in which the test space is an independent, compactly supported, piecewise-polynomial space evaluated with Gauss-re quadrature.
  arXiv  Detail & Related papers  (2026-07-22T17:08:29Z)
• Petrov-Galerkin Variational Physics-Informed Neural Network Framework for Two-Dimensional Singularly Perturbed Problems [14.126509388112302]
  This study proposes a Petrov-Galerkin based Variational Physics-Informed Neural Network (VPINN) for solving singularly perturbed problems.<n>The approach employs neural networks to construct the trial solution space, while tensor-product hat functions are adopted as test functions to enforce the variational form.
  arXiv  Detail & Related papers  (2026-06-15T10:13:50Z)
• An End-to-End PyTorch Interface for Differentiable PDE Solvers: A RANS Model-Correction Study [0.0]
  This work presents an end-to-end strategy for solving inverse problems constrained by Partial Differential Equations.<n>We show how to optimize phi within a fully differentiable Python workflow by reformulating the PDE as an implicit layer.<n>A dataset is generated starting from the VKI LS-59 turbine blade geometry using the differentiable BROADCAST solver with the Spalart-Allmaras turbulence model.
  arXiv  Detail & Related papers  (2026-05-19T07:38:50Z)
• 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)
• On the Optimal Construction of Unbiased Gradient Estimators for Zeroth-Order Optimization [57.179679246370114]
  A potential limitation of existing methods is the bias inherent in most perturbation estimators unless a stepsize is proposed.<n>We propose a novel family of unbiased gradient scaling estimators that eliminate bias while maintaining favorable construction.
  arXiv  Detail & Related papers  (2025-10-22T18:25:43Z)
• A Variational Physics-Informed Neural Network Framework Using Petrov-Galerkin Method for Solving Singularly Perturbed Boundary Value Problems [14.126509388112302]
  This work proposes a framework that integrates the Petrov-Galerkin formulation with deep neural networks (DNNs)<n>It solves one-dimensional singularly perturbed boundary value problems (BVPs) and parabolic partial differential equations (PDEs) involving one or two small parameters.
  arXiv  Detail & Related papers  (2025-09-13T18:25:00Z)
• Physics-informed low-rank neural operators with application to parametric elliptic PDEs [0.0]
  We present PILNO, a neural operator framework for approximating solution operators of partial differential equations (PDEs) on point cloud data.<n>PILNO combines low-rank kernel approximations with an encoder--decoder architecture, enabling fast, continuous one-shot predictions while remaining independent of specific discretizations.<n>We demonstrate its effectiveness on diverse problems, including function fitting, the Poisson equation, the screened Poisson equation with variable coefficients, and parameterized Darcy flow.
  arXiv  Detail & Related papers  (2025-09-09T12:54:06Z)
• Neural Hamiltonian Operator [2.1756081703276]
  An alternative to traditional dynamic programming is Pontryagin's Maximum Principle (PMP), which recasts the problem as a system of Forward-Backward Differential Equations (FBSDEs)<n>In this paper, we introduce a formal framework for solving such problems with deep learning by defining a textbfNeural Hamiltonian Operator (NHO).<n>We show how the optimal NHO can be found by training the underlying networks to enforce the consistency conditions dictated by the PMP.
  arXiv  Detail & Related papers  (2025-07-02T02:56:49Z)
• PIG: Physics-Informed Gaussians as Adaptive Parametric Mesh Representations [5.4087282763977855]
  We propose Physics-Informed Gaussians (PIGs), which combine feature embeddings using Gaussian functions with a lightweight neural network.<n>Our approach uses trainable parameters for the mean and variance of each Gaussian, allowing for dynamic adjustment of their positions and shapes during training.<n> Experimental results show the competitive performance of our model across various PDEs, demonstrating its potential as a robust tool for solving complex PDEs.
  arXiv  Detail & Related papers  (2024-12-08T16:58:29Z)
• RoPINN: Region Optimized Physics-Informed Neural Networks [66.38369833561039]
  Physics-informed neural networks (PINNs) have been widely applied to solve partial differential equations (PDEs) This paper proposes and theoretically studies a new training paradigm as region optimization. A practical training algorithm, Region Optimized PINN (RoPINN), is seamlessly derived from this new paradigm.
  arXiv  Detail & Related papers  (2024-05-23T09:45:57Z)
• Variational Bayesian Optimal Experimental Design with Normalizing Flows [0.837622912636323]
  Variational OED estimates a lower bound of the EIG without likelihood evaluations. We introduce the use of normalizing flows for representing variational distributions in vOED. We show that a composition of 4--5 layers is able to achieve lower EIG estimation bias.
  arXiv  Detail & Related papers  (2024-04-08T14:44:21Z)
• Deep Equilibrium Based Neural Operators for Steady-State PDEs [100.88355782126098]
  We study the benefits of weight-tied neural network architectures for steady-state PDEs. We propose FNO-DEQ, a deep equilibrium variant of the FNO architecture that directly solves for the solution of a steady-state PDE.
  arXiv  Detail & Related papers  (2023-11-30T22:34:57Z)
• Solving High-Dimensional PDEs with Latent Spectral Models [74.1011309005488]
  We present Latent Spectral Models (LSM) toward an efficient and precise solver for high-dimensional PDEs. Inspired by classical spectral methods in numerical analysis, we design a neural spectral block to solve PDEs in the latent space. LSM achieves consistent state-of-the-art and yields a relative gain of 11.5% averaged on seven benchmarks.
  arXiv  Detail & Related papers  (2023-01-30T04:58:40Z)
• Manifold Gaussian Variational Bayes on the Precision Matrix [70.44024861252554]
  We propose an optimization algorithm for Variational Inference (VI) in complex models. We develop an efficient algorithm for Gaussian Variational Inference whose updates satisfy the positive definite constraint on the variational covariance matrix. Due to its black-box nature, MGVBP stands as a ready-to-use solution for VI in complex models.
  arXiv  Detail & Related papers  (2022-10-26T10:12:31Z)
• Physics-Informed Neural Operator for Learning Partial Differential Equations [55.406540167010014]
  PINO is the first hybrid approach incorporating data and PDE constraints at different resolutions to learn the operator. The resulting PINO model can accurately approximate the ground-truth solution operator for many popular PDE families.
  arXiv  Detail & Related papers  (2021-11-06T03:41:34Z)
• Bayesian Sequential Optimal Experimental Design for Nonlinear Models Using Policy Gradient Reinforcement Learning [0.0]
  We formulate this sequential optimal experimental design (sOED) problem as a finite-horizon partially observable Markov decision process (POMDP) It is built to accommodate continuous random variables, general non-Gaussian posteriors, and expensive nonlinear forward models. We solve for the sOED policy numerically via policy gradient (PG) methods from reinforcement learning, and derive and prove the PG expression for sOED. The overall PG-sOED method is validated on a linear-Gaussian benchmark, and its advantages over batch and greedy designs are demonstrated through a contaminant source inversion problem in a
  arXiv  Detail & Related papers  (2021-10-28T17:47:31Z)
• Stochastic Learning Approach to Binary Optimization for Optimal Design of Experiments [0.0]
  We present a novel approach to binary optimization for optimal experimental design (OED) for Bayesian inverse problems governed by mathematical models such as partial differential equations. The OED utility function, namely, the regularized optimality gradient, is cast into an objective function in the form of an expectation over a Bernoulli distribution. The objective is then solved by using a probabilistic optimization routine to find an optimal observational policy.
  arXiv  Detail & Related papers  (2021-01-15T03:54:12Z)
• Optimal Bayesian experimental design for subsurface flow problems [77.34726150561087]
  We propose a novel approach for development of chaos expansion (PCE) surrogate model for the design utility function. This novel technique enables the derivation of a reasonable quality response surface for the targeted objective function with a computational budget comparable to several single-point evaluations.
  arXiv  Detail & Related papers  (2020-08-10T09:42:59Z)

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.