The Community for Technology Leaders
Green Image
<p>This paper concerns neural network approaches to function approximation and optimization using linear superposition of Gaussians (or what are popularly known as radial basis function (RBF) networks). The problem of function approximation is one of estimating an underlying function f, given samples of the form ((y/sub i/, x/sub i/); i=1,2,...,n; with y/sub i/=f(x/sub i/)). When the dimension of the input is high and the number of samples small, estimation of the function becomes difficult due to the sparsity of samples in local regions. The authors find that this problem of high dimensionality can be overcome to some extent by using linear transformations of the input in the Gaussian kernels. Such transformations induce intrinsic dimension reduction, and can be exploited for identifying key factors of the input and for the phase space reconstruction of dynamical systems, without explicitly computing the dimension and delay. They present a generalization that uses multiple linear projections onto scalars and successive RBF networks (MLPRBF) that estimate the function based on these scaler values. They derive some key properties of RBF networks that provide suitable grounds for implementing efficient search strategies for nonconvex optimization within the same framework.</p>
linear superpositions of Gaussians; dimension reduction; nonconvex optimization; neural network approaches; function approximation; radial basis function; function approximation; neural nets; optimisation; polynomials.

C. Wu, D. Tang and A. Saha, "Approximation, Dimension Reduction, and Nonconvex Optimization Using Linear Superpositions of Gaussians," in IEEE Transactions on Computers, vol. 42, no. , pp. 1222-1233, 1993.
92 ms
(Ver 3.3 (11022016))