资源分类
》 资源 》论文》Lower Bounds for Passive and Active Learning

Lower Bounds for Passive and Active Learning

2020-01-08 | |  66 |   42 |   0

Abstract

We develop unified information-theoretic machinery for deriving lower bounds for passive and active learning schemes. Our bounds involve the so-called Alexander’s capacity function. The supremum of this function has been recently rediscovered by Hanneke in the context of active learning under the name of “disagreement coefficient.” For passive learning, our lower bounds match the upper bounds of Gine and Koltchinskii up to constants and generalize analogous results of Massart and Nede?lec. For active learning, we provide first known lower bounds based on the capacity function rather than the disagreement coefficient.

上一篇：Message-Passing for Approximate MAP Inference with Latent Variables

下一篇：Object Detection with Grammar Models

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...