资源分类
》 资源 》论文》Active Learning with a Drifting Distribution

Active Learning with a Drifting Distribution

2020-01-08 | |  61 |   49 |   0

Abstract

We study the problem of active learning in a stream-based setting, allowing the distribution of the examples to change over time. We prove upper bounds on the number of prediction mistakes and number of label requests for established disagreement-based active learning algorithms, both in the realizable case and under Tsybakov noise. We further prove minimax lower bounds for this problem.

上一篇：SpaRCS: Recovering Low-Rank and Sparse Matrices from Compressive Measurements

下一篇：Hierarchically Supervised Latent Dirichlet Allocation

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

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

  • Learning to Predi...

    Much of model-based reinforcement learning invo...