Some new results on neural network approximation
暂无分享,去创建一个
[1] Allan Pinkus,et al. Multilayer Feedforward Networks with a Non-Polynomial Activation Function Can Approximate Any Function , 1991, Neural Networks.
[2] Yoshifusa Ito,et al. Approximation of continuous functions on Rd by linear combinations of shifted rotations of a sigmoid function with and without scaling , 1992, Neural Networks.
[3] George Cybenko,et al. Approximation by superpositions of a sigmoidal function , 1992, Math. Control. Signals Syst..
[4] Yoshifusa Ito,et al. Approximation of functions on a compact set by finite sums of a sigmoid function without scaling , 1991, Neural Networks.
[5] Vladik Kreinovich,et al. Arbitrary nonlinearity is sufficient to represent all functions by neural networks: A theorem , 1991, Neural Networks.
[6] Kurt Hornik,et al. Approximation capabilities of multilayer feedforward networks , 1991, Neural Networks.
[7] Kurt Hornik,et al. Universal approximation of an unknown mapping and its derivatives using multilayer feedforward networks , 1990, Neural Networks.
[8] Halbert White,et al. Approximating and learning unknown mappings using multilayer feedforward networks with bounded weights , 1990, 1990 IJCNN International Joint Conference on Neural Networks.
[9] H. White,et al. Universal approximation using feedforward networks with non-sigmoid hidden layer activation functions , 1989, International 1989 Joint Conference on Neural Networks.
[10] Ken-ichi Funahashi,et al. On the approximate realization of continuous mappings by neural networks , 1989, Neural Networks.
[11] Kurt Hornik,et al. FEED FORWARD NETWORKS ARE UNIVERSAL APPROXIMATORS , 1989 .
[12] W. Rudin,et al. Fourier Analysis on Groups. , 1965 .