TY  - JOUR
N2  - For certain families of multivariable vector-valued functions to be approximated, the accuracy of approximation schemes made up of linear combinations of computational units containing adjustable parameters is investigated. Upper bounds on the approximation error are derived that depend on the Rademacher complexities of the families. The estimates exploit possible relationships among the components of the multivariable vector-valued functions. All such components are approximated simultaneously in such a way to use, for a desired approximation accuracy, less computational units than those required by componentwise approximation. An application to -stage optimization problems is discussed. 
SP  - 1
TI  - Estimates of the Approximation Error Using Rademacher Complexity: Learning Vector-Valued Functions
EP  - 16
ID  - eprints1707
SN  - 1025-5834
N1  - This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 
AV  - public
PB  - Springer
VL  - 2008
Y1  - 2008///
UR  - http://www.journalofinequalitiesandapplications.com/content/2008/1/640758
A1  - Gnecco, Giorgio
A1  - Sanguineti, Marcello
JF  - Journal of Inequalities and Applications
ER  -