Approximation and estimation bounds for artificial neural networks. (English) Zbl 0818.68127

Summary: For a common class of artificial neural networks, the mean integrated squared error between the estimated network and a target function \(f\) is shown to be bounded by \[ O \left( {C^ 2_ f \over n} \right) + O \left( {nd \over N} \log N \right), \] where \(n\) is the number of nodes, \(d\) is the input dimension of the function, \(N\) is the number of training observations, and \(C_ f\) is the first absolute moment of the Fourier magnitude distribution of \(f\). The two contributions to this total risk are the approximation error and the estimation error. Approximation error refers to the distance between the target function and the closest neural network function of a given architecture and estimation error refers to the distance between this ideal network function and an estimated network function. With \(n \sim C_ f (N/(d \log N))^{1/2}\) nodes, the order of the bound on the mean integrated squared error is optimized to be \(O (C_ f ((d/N) \log N)^{1/2})\). The bound demonstrates surprisingly favorable properties of network estimation compared to traditional series and nonparametric curve estimation techniques in the case that \(d\) is moderately large. Similar bounds are obtained when the number of nodes \(n\) is not preselected as a function of \(C_ f\) (which is generally not known a priori), but rather the number of nodes is optimized from the observed data by the use of a complexity regularization or minimum description length criterion. The analysis involves Fourier techniques for the approximation error, metric entropy considerations for the estimation error, and a calculation of the index of resolvability of minimum complexity estimation of the family of networks.


68T05 Learning and adaptive systems in artificial intelligence