Pith. sign in

Exponential Expressivity of ReLU$^k$ Neural Networks on Gevrey Classes with Point Singularities

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

We analyze deep Neural Network emulation rates of smooth functions with point singularities in bounded, polytopal domains $\mathrm{D} \subset \mathbb{R}^d$, $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 $\mathrm{D}$, comprising the countably-normed spaces of I.M. Babu\v{s}ka and B.Q. Guo. As intermediate result, we prove that continuous, piecewise polynomial high order (``$p$-version'') finite elements with elementwise polynomial degree $p\in\mathbb{N}$ on arbitrary, regular, simplicial partitions of polyhedral domains $\mathrm{D} \subset \mathbb{R}^d$, $d\geq 2$ can be exactly emulated by neural networks combining ReLU and ReLU$^2$ activations. On shape-regular, simplicial partitions of polytopal domains $\mathrm{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. Babu\v{s}ka and B.Q. Guo.

citation-role summary

background 1

citation-polarity summary

fields

cs.LG 1

years

2025 1

verdicts

CONDITIONAL 1

roles

background 1

polarities

unclear 1

representative citing papers

On the algorithmic construction of deep ReLU networks

cs.LG · 2025-06-23 · conditional · novelty 6.0

The author constructively programs deep ReLU networks to sort exactly and to approximate special functions with exponentially small error, using folding operations and conditional branching.

citing papers explorer

Showing 1 of 1 citing paper.

  • On the algorithmic construction of deep ReLU networks cs.LG · 2025-06-23 · conditional · none · ref 17 · internal anchor

    The author constructively programs deep ReLU networks to sort exactly and to approximate special functions with exponentially small error, using folding operations and conditional branching.