Bayesian PINNs for elliptic PDEs have posteriors that contract around the true solution at near-optimal rates, with the prior adapting automatically to unknown smoothness.
arXiv preprint arXiv:2110.06897 , year=
3 Pith papers cite this work. Polarity classification is still indexing.
abstract
In this paper, we study the statistical limits of deep learning techniques for solving elliptic partial differential equations (PDEs) from random samples using the Deep Ritz Method (DRM) and Physics-Informed Neural Networks (PINNs). To simplify the problem, we focus on a prototype elliptic PDE: the Schr\"odinger equation on a hypercube with zero Dirichlet boundary condition, which has wide application in the quantum-mechanical systems. We establish upper and lower bounds for both methods, which improves upon concurrently developed upper bounds for this problem via a fast rate generalization bound. We discover that the current Deep Ritz Methods is sub-optimal and propose a modified version of it. We also prove that PINN and the modified version of DRM can achieve minimax optimal bounds over Sobolev spaces. Empirically, following recent work which has shown that the deep model accuracy will improve with growing training sets according to a power law, we supply computational experiments to show a similar behavior of dimension dependent power law for deep PDE solvers.
years
2026 3verdicts
UNVERDICTED 3representative citing papers
For single- and two-index neural hypotheses in the deep Ritz method for the Schrödinger equation, gradient descent converges in O(log(1/ε)) iterations and the Ritz minimizer aligns with the source feature; a second feature emerges as regularization varies.
Proves sharp operator-norm concentration and expectation bounds for sample cross-covariances of sub-Gaussian and Gaussian vectors, governed by effective ranks of the marginal covariances.
citing papers explorer
-
Posterior Concentration of Bayesian Physics-Informed Neural Networks for Elliptic PDEs
Bayesian PINNs for elliptic PDEs have posteriors that contract around the true solution at near-optimal rates, with the prior adapting automatically to unknown smoothness.
-
Feature Learning for the High Dimensional Stationary Sch\"odinger Equation with Deep Ritz Method
For single- and two-index neural hypotheses in the deep Ritz method for the Schrödinger equation, gradient descent converges in O(log(1/ε)) iterations and the Ritz minimizer aligns with the source feature; a second feature emerges as regularization varies.
-
Concentration Inequalities for Sample Cross-Covariances
Proves sharp operator-norm concentration and expectation bounds for sample cross-covariances of sub-Gaussian and Gaussian vectors, governed by effective ranks of the marginal covariances.