Local Rademacher Complexity: sharper risk bounds with and without unlabeled samples.
Journal:
Neural networks : the official journal of the International Neural Network Society
Published Date:
Feb 16, 2015
Abstract
We derive in this paper a new Local Rademacher Complexity risk bound on the generalization ability of a model, which is able to take advantage of the availability of unlabeled samples. Moreover, this new bound improves state-of-the-art results even when no unlabeled samples are available.