Shallow and Deep Networks are Near-Optimal Approximators of Korobov Functions
In this paper, we analyze the number of neurons and training parameters that a neural network needs to approximate multivariate functions of bounded second mixed derivatives --- Korobov functions. We prove upper bounds on these quantities for shallow and deep neural networks, drastically lessening the curse of dimensionality. Our bounds hold for general activation functions, including ReLU. We further prove that these bounds nearly match the minimal number of parameters any continuous function approximator needs to approximate Korobov functions, showing that neural networks are near-optimal function approximators.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
The Representation Power of Neural Networks: Breaking the Curse of Dimensionality
In this paper, we analyze the number of neurons and training parameters that a neural networks needs to approximate multivariate functions of bounded second mixed derivatives -- Korobov functions. We prove upper bounds o…
On the Dimension-Free Approximation of Deep Neural Networks for Symmetric Korobov Functions
Deep neural networks have been widely used as universal approximators for functions with inherent physical structures, including permutation symmetry. In this paper, we construct symmetric deep neural networks to approxi…
Optimal Deep Neural Network Approximation for Korobov Functions with respect to Sobolev Norms
This paper establishes the nearly optimal rate of approximation for deep neural networks (DNNs) when applied to Korobov functions, effectively overcoming the curse of dimensionality. The approximation results presented i…
Generalization Analysis for Classification on Korobov Space
In this paper, the classification algorithm arising from Tikhonov regularization is discussed. The main intention is to derive learning rates for the excess misclassification error according to the convex $η$-norm loss f…
Some Super-approximation Rates of ReLU Neural Networks for Korobov Functions
This paper examines the $L_p$ and $W^1_p$ norm approximation errors of ReLU neural networks for Korobov functions. In terms of network width and depth, we derive nearly optimal super-approximation error bounds of order $…