Random subclass bounds
Mendelson, Shahar; Philips, Petra
Description
It has been recently shown that sharp generalization bounds can be obtained when the function class from which the algorithm chooses its hypotheses is "small" in the sense that the Rademacher averages of this function class are small. Seemingly based on different arguments, generalization bounds were obtained in the compression scheme, luckiness, and algorithmic luckiness frameworks in which the "size" of the function class is not specified a priori. We show that the bounds obtained in all...[Show more]
dc.contributor.author | Mendelson, Shahar | |
---|---|---|
dc.contributor.author | Philips, Petra | |
dc.coverage.spatial | Washington USA | |
dc.date.accessioned | 2015-12-13T23:12:22Z | |
dc.date.available | 2015-12-13T23:12:22Z | |
dc.date.created | August 24 2003 | |
dc.identifier.isbn | 3540407200 | |
dc.identifier.uri | http://hdl.handle.net/1885/88023 | |
dc.description.abstract | It has been recently shown that sharp generalization bounds can be obtained when the function class from which the algorithm chooses its hypotheses is "small" in the sense that the Rademacher averages of this function class are small. Seemingly based on different arguments, generalization bounds were obtained in the compression scheme, luckiness, and algorithmic luckiness frameworks in which the "size" of the function class is not specified a priori. We show that the bounds obtained in all these frameworks follow from the same general principle, namely that coordinate projections of this function subclass evaluated on random samples are "small" with high probability. | |
dc.publisher | Springer | |
dc.relation.ispartofseries | Annual Conference on Computational Learning Theory (COLT 2003) | |
dc.source | Computational Learning Theory and Kernel Machines, 16th Annual Conference on Computational Learning Theory and 7th Kernel Workshop, COLT/Kernel 2003, Washington DC, USA, August 24-27, 2003 | |
dc.source.uri | http://www.informatik.uni-trier.de/~ley/db/conf/colt | |
dc.title | Random subclass bounds | |
dc.type | Conference paper | |
local.description.notes | Imported from ARIES | |
local.description.refereed | Yes | |
dc.date.issued | 2003 | |
local.identifier.absfor | 080614 - Pacific Peoples Information and Knowledge Systems | |
local.identifier.ariespublication | MigratedxPub17531 | |
local.type.status | Published Version | |
local.contributor.affiliation | Mendelson, Shahar, College of Engineering and Computer Science, ANU | |
local.contributor.affiliation | Philips, Petra, College of Engineering and Computer Science, ANU | |
local.bibliographicCitation.startpage | 1 | |
local.bibliographicCitation.lastpage | 17 | |
dc.date.updated | 2015-12-12T08:31:21Z | |
local.identifier.scopusID | 2-s2.0-9444278349 | |
Collections | ANU Research Publications |
Download
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.
Updated: 17 November 2022/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator