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)
This is the latest version of this item.
| 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: | 17 Sep 2013 08:11 |
| Last Modified: | 17 Sep 2013 08:11 |
| URI: | http://eprints.imtlucca.it/id/eprint/1756 |
Available Versions of this Item
-
Deriving approximation error bounds via Rademacher’s complexity and learning theory. (deposited 10 Sep 2013 10:59)
- Deriving Approximation Error Bounds via Rademacher’s Complexity and Learning Theory. (deposited 17 Sep 2013 08:11) [Currently Displayed]
Actions (login required)
 |
Edit Item |
