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

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, citeshen2020deep 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. Existing works using the (N,L)-characterization focus on function classes with finite smoothness s, establishing a typical approximation rate of Oleft(N-2s/dL-2s/dright) with d denoting the input dimension, which indicates that network depth and width play symmetric roles for these classes. In contrast, this paper establishes upper bounds for the approximation of analytic functions, which possess infinite smoothness, via ReLU networks under the (N,L)-characterization. Specifically, we derive approximation rates of Oleft(N^-C Lτright), where C>0 is some constant and τ>0 is a parameter influenced by the relation between L and N. In particular, τ=1 if N scales roughly as Ld. Our findings reveal that depth plays a more critical role than width in the context of analytic function approximation. The main technical difficulty of obtaining such upper bounds lies in the trade-off between the smoothness parameters and the approximation accuracy. To overcome this difficulty, we employ refined constructions of several ReLU networks to approximate power functions, multivariate multiplication, and polynomials, which may be of independent interest.