Complexity regularization via localized random penalties

dc.creatorLugosi, Gabor
dc.creatorWegkamp, Marten
dc.date2004-10-05
dc.date.accessioned2026-07-07T08:06:32Z
dc.date.available2026-07-07T08:06:32Z
dc.descriptionIn this article, model selection via penalized empirical loss minimization in nonparametric classification problems is studied. Data-dependent penalties are constructed, which are based on estimates of the complexity of a small subclass of each model class, containing only those functions with small empirical loss. The penalties are novel since those considered in the literature are typically based on the entire model class. Oracle inequalities using these penalties are established, and the advantage of the new penalties over those based on the complexity of the whole model class is demonstrated.
dc.descriptionPublished by the Institute of Mathematical Statistics (http://www.imstat.org) in the Annals of Statistics (http://www.imstat.org/aos/) at http://dx.doi.org/10.1214/009053604000000463
dc.identifierhttps://arxiv.org/abs/math/0410091
dc.identifierhttp://arxiv.org/abs/math/0410091
dc.identifierAnnals of Statistics 2004, Vol. 32, No. 4, 1679-1697
dc.identifierdoi:10.1214/009053604000000463
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/130637
dc.subjectStatistics Theory
dc.subject62H30, 62G99 (Primary) 60E15. (Secondary)
dc.titleComplexity regularization via localized random penalties
dc.typetext

Files

Collections