Generalization Bounds for Physics-Informed Neural Networks for the Incompressible Navier-Stokes Equations

• URL: http://arxiv.org/abs/2603.23072v1
• Date: Tue, 24 Mar 2026 11:08:34 GMT
• Title: Generalization Bounds for Physics-Informed Neural Networks for the Incompressible Navier-Stokes Equations
• Abstract summary: This work establishes rigorous first-of-its-kind upper bounds on the generalization error for the method of approximating solutions to Navier-Stokes equations.<n>We trained depth-2 neural networks trained via the unsupervised Physics-Informed Neural Network framework.<n>We provide empirical validation of the suggested activation functions and the corresponding bounds on a PINN setup solving the Taylor-Green vortex benchmark.
• Score: 42.57657519369106
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This work establishes rigorous first-of-its-kind upper bounds on the generalization error for the method of approximating solutions to the (d+1)-dimensional incompressible Navier-Stokes equations by training depth-2 neural networks trained via the unsupervised Physics-Informed Neural Network (PINN) framework. This is achieved by bounding the Rademacher complexity of the PINN risk. For appropriately weight bounded net classes our derived generalization bounds do not explicitly depend on the network width and our framework characterizes the generalization gap in terms of the fluid's kinematic viscosity and loss regularization parameters. In particular, the resulting sample complexity bounds are dimension-independent. Our generalization bounds suggest using novel activation functions for solving fluid dynamics. We provide empirical validation of the suggested activation functions and the corresponding bounds on a PINN setup solving the Taylor-Green vortex benchmark.

Related papers

• Unified generalization analysis for physics informed neural networks [23.137880798964165]
  We derive bounds for neural networks that involve differentiation with respect to input variables, covering PINNs and VPINNs under a unified framework.<n>We show that the nonlinearity of the differential operator exponentially enlarges the bound, highlighting its significant impact on generalization.
  arXiv  Detail & Related papers  (2026-05-13T09:42:33Z)
• General-Kindred Physics-Informed Neural Network to the Solutions of Singularly Perturbed Differential Equations [11.121415128908566]
  We propose the General-Kindred Physics-Informed Neural Network (GKPINN) for solving Singular Perturbation Differential Equations (SPDEs) This approach utilizes prior knowledge of the boundary layer from the equation and establishes a novel network to assist PINN in approxing the boundary layer. The research findings underscore the exceptional performance of our novel approach, GKPINN, which delivers a remarkable enhancement in reducing the $L$ error by two to four orders of magnitude compared to the established PINN methodology.
  arXiv  Detail & Related papers  (2024-08-27T02:03:22Z)
• Neural Networks-based Random Vortex Methods for Modelling Incompressible Flows [0.0]
  We introduce a novel Neural Networks-based approach for approximating solutions to the (2D) incompressible Navier--Stokes equations.<n>Our algorithm uses a Neural Network (NN), that approximates the vorticity based on a loss function that uses a computationally efficient formulation of the Random Vortex Dynamics.
  arXiv  Detail & Related papers  (2024-05-22T14:36:23Z)
• Information-Theoretic Generalization Bounds for Deep Neural Networks [20.015357820733406]
  Deep neural networks (DNNs) exhibit an exceptional capacity for generalization in practical applications.<n>This work aims to capture the effect and benefits of depth for supervised learning via information-theoretic generalization bounds.
  arXiv  Detail & Related papers  (2024-04-04T03:20:35Z)
• Generalization of Scaled Deep ResNets in the Mean-Field Regime [55.77054255101667]
  We investigate emphscaled ResNet in the limit of infinitely deep and wide neural networks. Our results offer new insights into the generalization ability of deep ResNet beyond the lazy training regime.
  arXiv  Detail & Related papers  (2024-03-14T21:48:00Z)
• Tunable Complexity Benchmarks for Evaluating Physics-Informed Neural Networks on Coupled Ordinary Differential Equations [64.78260098263489]
  In this work, we assess the ability of physics-informed neural networks (PINNs) to solve increasingly-complex coupled ordinary differential equations (ODEs) We show that PINNs eventually fail to produce correct solutions to these benchmarks as their complexity increases. We identify several reasons why this may be the case, including insufficient network capacity, poor conditioning of the ODEs, and high local curvature, as measured by the Laplacian of the PINN loss.
  arXiv  Detail & Related papers  (2022-10-14T15:01:32Z)
• Lagrangian PINNs: A causality-conforming solution to failure modes of physics-informed neural networks [5.8010446129208155]
  Physics-informed neural networks (PINNs) leverage neural-networks to find the solutions of partial differential equation (PDE)-constrained optimization problems. We show that the challenge of training persists even when the boundary conditions are strictly enforced. We propose reformulating PINNs on a Lagrangian frame of reference, i.e., LPINNs, as a PDE-informed solution.
  arXiv  Detail & Related papers  (2022-05-05T19:48:05Z)
• A Convergence Theory Towards Practical Over-parameterized Deep Neural Networks [56.084798078072396]
  We take a step towards closing the gap between theory and practice by significantly improving the known theoretical bounds on both the network width and the convergence time. We show that convergence to a global minimum is guaranteed for networks with quadratic widths in the sample size and linear in their depth at a time logarithmic in both. Our analysis and convergence bounds are derived via the construction of a surrogate network with fixed activation patterns that can be transformed at any time to an equivalent ReLU network of a reasonable size.
  arXiv  Detail & Related papers  (2021-01-12T00:40:45Z)
• Complexity Measures for Neural Networks with General Activation Functions Using Path-based Norms [18.487936403345167]
  A simple approach is proposed to obtain complexity controls for neural networks with general activation functions. We consider two-layer networks and deep residual networks, for which path-based norms are derived to control complexities.
  arXiv  Detail & Related papers  (2020-09-14T01:15:11Z)
• Generalization bound of globally optimal non-convex neural network training: Transportation map estimation by infinite dimensional Langevin dynamics [50.83356836818667]
  We introduce a new theoretical framework to analyze deep learning optimization with connection to its generalization error. Existing frameworks such as mean field theory and neural tangent kernel theory for neural network optimization analysis typically require taking limit of infinite width of the network to show its global convergence.
  arXiv  Detail & Related papers  (2020-07-11T18:19:50Z)
• Convex Geometry and Duality of Over-parameterized Neural Networks [70.15611146583068]
  We develop a convex analytic approach to analyze finite width two-layer ReLU networks. We show that an optimal solution to the regularized training problem can be characterized as extreme points of a convex set. In higher dimensions, we show that the training problem can be cast as a finite dimensional convex problem with infinitely many constraints.
  arXiv  Detail & Related papers  (2020-02-25T23:05:33Z)

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.