Complexity regularization via localized random penalties
摘要
In 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.
引用
@article{arxiv.math/0410091,
title = {Complexity regularization via localized random penalties},
author = {Gabor Lugosi and Marten Wegkamp},
journal= {arXiv preprint arXiv:math/0410091},
year = {2007}
}
备注
Published 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