Gnecco, Giorgio and Sanguineti, Marcello Estimates of the Approximation Error Using Rademacher Complexity: Learning Vector-Valued Functions. Journal of Inequalities and Applications, 2008. pp. 1-16. ISSN 1025-5834 (2008)
|
PDF
- Published Version
Available under License Creative Commons Attribution. Download (547kB) | Preview |
Abstract
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.
| Item Type: | Article |
|---|---|
| Identification Number: | https://doi.org/10.1155/2008/640758 |
| Additional Information: | 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. |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Research Area: | Computer Science and Applications |
| Depositing User: | Giorgio Gnecco |
| Date Deposited: | 13 Sep 2013 09:19 |
| Last Modified: | 16 Sep 2013 12:03 |
| URI: | http://eprints.imtlucca.it/id/eprint/1707 |
Actions (login required)
 |
Edit Item |
