Neural Networks for Singular Perturbations -- Finite Regularity
F. Rohner, Ch. Schwab, C. Xenophontos

TL;DR
This paper analyzes the expressivity and approximation rates of neural networks and finite-element methods for singularly perturbed elliptic boundary value problems, emphasizing robustness to perturbation parameters and low regularity data.
Contribution
It provides explicit, -robust Sobolev norm bounds for neural networks and finite-element methods solving singular perturbation problems, including novel deep neural network expressivity results.
Findings
-robust algebraic expression rate bounds for finite elements on exponential and Shishkin meshes
Neural network approximation rates are robust to the perturbation parameter
Deep neural networks with ReLU and tanh activations can achieve twice the convergence rate of finite elements under certain conditions.
Abstract
We study finite-element and deep feedforward neural network (DNN for short) expressivity rate bounds for solution sets of a model linear, second order singularly perturbed, elliptic two-point boundary value problem, in Sobolev norms on a bounded interval , with explicit dependence on the singular perturbation parameter . Emphasis is on low Sobolev regularity of the data, i.e., source term and reaction coefficient . A proof of -explicit solution regularity based on exponentially weighted energy-norm bounds is developed, and \emph{-robust, algebraic expression rate bounds} in Sobolev norms for Finite-Elements on exponential and Shishkin type meshes is proved. Expression rates for shallow (fixed depth) -NNs are shown which are robust w.r. to and explicit in terms of the NN size. Robust NN expression rate bounds are further…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
