Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Random subclass bounds

Simple item page
dc.contributor.authorMendelson, Shahar
dc.contributor.authorPhilips, Petra
dc.coverage.spatialWashington USA
dc.date.accessioned2015-12-13T23:12:22Z
dc.date.available2015-12-13T23:12:22Z
dc.date.createdAugust 24 2003
dc.date.issued2003
dc.date.updated2015-12-12T08:31:21Z
dc.description.abstractIt 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.identifier.isbn3540407200
dc.identifier.urihttp://hdl.handle.net/1885/88023
dc.publisherSpringer
dc.relation.ispartofseriesAnnual Conference on Computational Learning Theory (COLT 2003)
dc.sourceComputational 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.urihttp://www.informatik.uni-trier.de/~ley/db/conf/colt
dc.titleRandom subclass bounds
dc.typeConference paper
local.bibliographicCitation.lastpage17
local.bibliographicCitation.startpage1
local.contributor.affiliationMendelson, Shahar, College of Engineering and Computer Science, ANU
local.contributor.affiliationPhilips, Petra, College of Engineering and Computer Science, ANU
local.contributor.authoruidMendelson, Shahar, u4011413
local.contributor.authoruidPhilips, Petra, u4038889
local.description.notesImported from ARIES
local.description.refereedYes
local.identifier.absfor080614 - Pacific Peoples Information and Knowledge Systems
local.identifier.ariespublicationMigratedxPub17531
local.identifier.scopusID2-s2.0-9444278349
local.type.statusPublished Version

Downloads

Collections

ANU Research Publications

DSpace software copyright © 2002-2026 LYRASIS