A Comparison between Fixed‐Basis and Variable‐Basis Schemes for Function Approximation and Functional Optimization

Giorgio Gnecco

Journal of Applied Mathematics, 2012, vol. 2012, issue 1

Abstract: 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 d‐variable functions whose actual dependence is on a subset of d′ ≪ d variables, where the indices of these d′ variables are not known a priori.

Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2012/806945

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2012:y:2012:i:1:n:806945

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().