arXiv · 1606.00922
Localization of VC Classes: Beyond Local Rademacher Complexities
Abstract
In this paper we introduce an alternative localization approach for binary classification that leads to a novel complexity measure: fixed points of the local empirical entropy. We show that this complexity measure gives a tight control over complexity in the upper bounds. Our results are accompanied by a novel minimax lower bound that involves the same quantity. In particular, we practically answer the question of optimality of ERM under bounded noise for general VC classes.
Explore related subjects
Keep this discovery
Nikita Zhivotovskiy, Steve Hanneke. 2016-06-02. Localization of VC Classes: Beyond Local Rademacher Complexities. https://arxiv.org/abs/1606.00922
Cite the original work for its findings. Save a collection to share your selection of sources.