English

High-Order Approximation Rates for Shallow Neural Networks with Cosine and ReLU$^k$ Activation Functions

Numerical Analysis 2021-12-23 v7 Numerical Analysis

Abstract

We study the approximation properties of shallow neural networks with an activation function which is a power of the rectified linear unit. Specifically, we consider the dependence of the approximation rate on the dimension and the smoothness in the spectral Barron space of the underlying function ff to be approximated. We show that as the smoothness index ss of ff increases, shallow neural networks with ReLUk^k activation function obtain an improved approximation rate up to a best possible rate of O(n(k+1)log(n))O(n^{-(k+1)}\log(n)) in L2L^2, independent of the dimension dd. The significance of this result is that the activation function ReLUk^k is fixed independent of the dimension, while for classical methods the degree of polynomial approximation or the smoothness of the wavelets used would have to increase in order to take advantage of the dimension dependent smoothness of ff. In addition, we derive improved approximation rates for shallow neural networks with cosine activation function on the spectral Barron space. Finally, we prove lower bounds showing that the approximation rates attained are optimal under the given assumptions.

Keywords

Cite

@article{arxiv.2012.07205,
  title  = {High-Order Approximation Rates for Shallow Neural Networks with Cosine and ReLU$^k$ Activation Functions},
  author = {Jonathan W. Siegel and Jinchao Xu},
  journal= {arXiv preprint arXiv:2012.07205},
  year   = {2021}
}