Estimates of the Approximation Error Using Rademacher Complexity: Learning Vector-Valued Functions
<p>Abstract</p> <p>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...
Main Authors: | Sanguineti Marcello, Gnecco Giorgio |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2008-01-01
|
Series: | Journal of Inequalities and Applications |
Online Access: | http://www.journalofinequalitiesandapplications.com/content/2008/640758 |
Similar Items
-
Estimates of the Approximation Error Using Rademacher Complexity: Learning Vector-Valued Functions
by: Giorgio Gnecco, et al.
Published: (2009-02-01) -
Differentiability and ApproximateDifferentiability for Intrinsic LipschitzFunctions in Carnot Groups and a RademacherTheorem
by: Franchi Bruno, et al.
Published: (2014-01-01) -
Self-Adaptive Deep Multiple Kernel Learning Based on Rademacher Complexity
by: Shengbing Ren, et al.
Published: (2019-03-01) -
The classification of Boolean functions using the Rademacher-Walsh transform
by: Anderson, Neil Arnold
Published: (2007) -
A Literature Study Concerning Generalization Error Bounds for Neural Networks via Rademacher Complexity
by: Nordenfors, Oskar
Published: (2021)