TY - JOUR
T1 - High-order approximation rates for shallow neural networks with cosine and ReLUk activation functions
AU - Siegel, Jonathan W.
AU - Xu, Jinchao
N1 - Generated from Scopus record by KAUST IRTS on 2023-02-15
PY - 2022/5/1
Y1 - 2022/5/1
N2 - 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 f to be approximated. We show that as the smoothness index s of f increases, shallow neural networks with ReLUk activation function obtain an improved approximation rate up to a best possible rate of O(n−(k+1)log(n)) in L2, independent of the dimension d. The significance of this result is that the activation function ReLUk 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 f. 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.
AB - 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 f to be approximated. We show that as the smoothness index s of f increases, shallow neural networks with ReLUk activation function obtain an improved approximation rate up to a best possible rate of O(n−(k+1)log(n)) in L2, independent of the dimension d. The significance of this result is that the activation function ReLUk 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 f. 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.
UR - https://linkinghub.elsevier.com/retrieve/pii/S1063520321001056
UR - http://www.scopus.com/inward/record.url?scp=85121663168&partnerID=8YFLogxK
U2 - 10.1016/j.acha.2021.12.005
DO - 10.1016/j.acha.2021.12.005
M3 - Article
SN - 1096-603X
VL - 58
SP - 1
EP - 26
JO - Applied and Computational Harmonic Analysis
JF - Applied and Computational Harmonic Analysis
ER -