论文部分内容阅读
Let SFd and Πψ,n,d = { nj=1bjψ(ωj·x+θj) :bj,θj∈R,ωj∈Rd} be the set of periodic and Lebesgue’s square-integrable functions and the set of feedforward neural network (FNN) functions, respectively. Denote by dist (SF d, Πψ,n,d) the deviation of the set SF d from the set Πψ,n,d. A main purpose of this paper is to estimate the deviation. In particular, based on the Fourier transforms and the theory of approximation, a lower estimation for dist (SFd, Πψ,n,d) is proved. That is, dist(SF d, Πψ,n,d) (nlogC2n)1/2 . The obtained estimation depends only on the number of neuron in the hidden layer, and is independent of the approximated target functions and dimensional number of input. This estimation also reveals the relationship between the approximation rate of FNNs and the topology structure of hidden layer.
Let SFd and Πψ, n, d = {nj = 1bjψ (ωj · x + θj): bj, θj∈R, ωj∈Rd} be the set of periodic and Lebesgue’s square-integrable functions and the set of feedforward neural network ( FNN) functions, respectively. Denote by dist (SF d, Πψ, n, d) the deviation of the set SF d from the set Πψ, n, d. A main purpose of this paper is to estimate the deviation. based on the Fourier transforms and the theory of approximation, a lower estimation for dist (SFd, Πψ, n, d) is proved. That is, dist (SF d, Πψ, n, d) (nlogC2n) 1/2. obtained estimation depends only on the number of neuron in the hidden layer, and is independent of the approximated target functions and dimensional number of input. This estimation also reveals the relationship between the approximation rate of FNNs and the topology structure of hidden layer.