Neural Networks for Singular Perturbations -- Finite Regularity
Provides theoretical guarantees for neural network expressivity in solving singularly perturbed PDEs, a class of problems relevant to fluid dynamics and reaction-diffusion systems.
The paper proves that deep ReLU and tanh neural networks achieve twice the robust convergence rate of P1 finite elements for singularly perturbed elliptic problems under low data regularity, with explicit dependence on the perturbation parameter.
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 $(-1,1)$, with explicit dependence on the singular perturbation parameter $\e\in (0,1]$. Emphasis is on low Sobolev regularity of the data, i.e., source term $f$ and reaction coefficient $b$. A proof of $\e$-explicit solution regularity based on exponentially weighted energy-norm bounds is developed, and \emph{$\e$-robust, algebraic expression rate bounds} in Sobolev norms for $\mathbb{P}_1$ Finite-Elements on exponential and Shishkin type meshes is proved. Expression rates for shallow (fixed depth) $\ReLU$-NNs are shown which are robust w.r. to $\e$ and explicit in terms of the NN size. Robust NN expression rate bounds are further studied for deep feedforward DNNs with ReLU and tanh-activations. As in \cite{OSX24_1085}, tanh- and sigmoid-activated sub-NNs allow to include exponential boundary layer functions exactly into the NN feature space, leading to reduced NN sizes. Recent bitstring encoding techniques for deep NNs with ReLU activations afford, still under low data regularity $f,b \in H^1(I)$ \emph{twice the (robust) convergence rate of $\mathbb{P}_1$ Finite-Elements} achievable with ``eXp'' or Shishkin meshes.