A comparison between fixed-basis and variable-basis schemes for function approximation and functional optimization (Q411092)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A comparison between fixed-basis and variable-basis schemes for function approximation and functional optimization |
scientific article |
Statements
A comparison between fixed-basis and variable-basis schemes for function approximation and functional optimization (English)
0 references
4 April 2012
0 references
Summary: 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' \ll d\) variables, where the indices of these \(d'\) variables are not known a-priori.
0 references
function approximation
0 references
functional optimization
0 references
infinite programming
0 references
fixed-basis and variable-basis approximation schemes
0 references
0 references
0 references