arXiv Machine Learning

Depth Separation for Neural Networks under Gaussian Measure

The paper investigates depth separation for neural networks in the context of $L^2$ approximation of radial functions under a standard Gaussian measure in $d$ dimensions. It demonstrates that a particular radial function can be approximated within a fixed small $L^2$ error by a depth‑3 ReLU network of polynomial size in $d$, yet any depth‑2 network approximating the same function with bounded weights must have size exponential in $d$. The authors prove a general result linking high‑frequency Hermite expansion mass to the limitations of depth‑2 networks with small width and bounded weights, and all results are formally verified in Lean 4.

arXiv Machine Learning
Jul 14

Approximation of Analytic Functions by ReLU Neural Networks with Adjustable Depth and Width

arXiv:2607. 10589v1 Announce Type: cross Abstract: In contrast to most studies on neural network approximation theory that characterize results through a single parameter, such as the total number of network parameters, \cite{shen2020deep} pioneered the characterization of approximation rates as a joint function of the width parameter $N$ and the depth parameter $L$, thereby granting greater architectural flexibility.

By Yanming Lai, Defeng Sun, Yang Wang
arXiv Machine Learning
Jun 24

Layer-wise Geometric Approximation Rates for Deep Networks

arXiv:2604. 20219v2 Announce Type: replace Abstract: Depth is widely viewed as a central contributor to the success of deep neural networks, whereas standard neural network approximation theory typically provides guarantees only for the final output and leaves the role of intermediate layers largely unclear.

By Shijun Zhang, Zuowei Shen, Yuesheng Xu
arXiv Machine Learning
Aug 28

High Probability Derivative Bounds for Random tanh Neural Networks on a Hypercube

The paper establishes high‑probability bounds on mixed input derivatives for wide random neural networks whose activation derivatives grow factorially, with a focus on anh networks initialized with Xavier weights. For scalar‑output anh networks with Gaussian weights, the authors prove that when the hidden width exceeds a depth‑dependent threshold, the derivative of any order satisfies a bound that is independent of depth for first‑order derivatives and grows at most polynomially with depth for higher‑order mixed derivatives. These results yield high‑probability estimates for the Euclidean Lipschitz constant and weighted Sobolev norms, linking the regularity of network realizations to quasi‑Monte Carlo integration and its potential impact on QMC‑based training.

By Josef Dick, Michael Feischl, Fabian Zehetgruber