%X Fixed-basis and variable-basis approximation schemes are compared for the problems of function approximation and functional optimization (also known as infinite programming). Classes of problems are investigated for which variable-basis schemes with sigmoidal computational
units perform better than fixed-basis ones, in terms of the minimum number of computational units needed to achieve a desired error in function approximation or approximate optimization. Previously known bounds on the accuracy are extended, with better rates, to families of 
%L eprints1723
%D 2012
%A Giorgio Gnecco
%R 10.1155/2012/806945
%J Journal of Applied Mathematics
%P 1-17
%T A Comparison between Fixed-Basis and Variable-Basis Schemes for Function Approximation and Functional Optimization
%I Hindawi Publishing Corporation
%V 2012