Exponential Expressivity of ReLUk Neural Networks on Gevrey Classes with Point Singularities
Abstract
We analyze deep Neural Network emulation rates of smooth functions with point singularities in bounded, polytopal domains D ⊂ Rd, d=2,3. We prove exponential emulation rates in Sobolev spaces in terms of the number of neurons and in terms of the number of nonzero coefficients for Gevrey-regular solution classes defined in terms of weighted Sobolev scales in D, comprising the countably-normed spaces of I.M. Babuska and B.Q. Guo. As intermediate result, we prove that continuous, piecewise polynomial high order (``p-version'') finite elements with elementwise polynomial degree p∈N on arbitrary, regular, simplicial partitions of polyhedral domains D ⊂ Rd, d≥ 2 can be exactly emulated by neural networks combining ReLU and ReLU2 activations. On shape-regular, simplicial partitions of polytopal domains D, both the number of neurons and the number of nonzero parameters are proportional to the number of degrees of freedom of the finite element space, in particular for the hp-Finite Element Method of I.M. Babuska and B.Q. Guo.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.