Deriving approximation error bounds via Rademacher’s complexity and learning theory

Gnecco, Giorgio and Sanguineti, Marcello Deriving approximation error bounds via Rademacher’s complexity and learning theory. In: AIRO 2007, September 5th-8th, 2007, Genoa, Italy p. 25. (2007)

There is a more recent version of this item available.

Full text not available from this repository.

Item Type:	Conference or Workshop Item (Paper)
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Research Area:	Computer Science and Applications
Depositing User:	Giorgio Gnecco
Date Deposited:	10 Sep 2013 10:59
Last Modified:	16 Sep 2013 12:03
URI:	http://eprints.imtlucca.it/id/eprint/1660

Available Versions of this Item

Deriving approximation error bounds via Rademacher’s complexity and learning theory. (deposited 10 Sep 2013 10:59) [Currently Displayed]
- Deriving Approximation Error Bounds via Rademacher’s Complexity and Learning Theory. (deposited 17 Sep 2013 08:11)

Actions (login required)

Edit Item