资源论文Nonmyopic ε-Bayes-Optimal Active Learning of Gaussian Processes

Nonmyopic ε-Bayes-Optimal Active Learning of Gaussian Processes

2020-03-03 | |  52 |   33 |   0

Abstract

A fundamental issue in active learning of Gaussian processes is that of the explorationexploitation trade-off. This paper presents a novel nonmyopic ε-Bayes-optimal active learning (ε-BAL) approach that jointly and naturally optimizes the trade-off. In contrast, existing works have primarily developed myopic/greedy algorithms or performed exploration and exploitation separately. To perform active learning in real time, we then propose an anytime algorithm based on ε-BAL with performance guarantee and empirically demonstrate using synthetic and real-world datasets that, with limited budget, it outperforms the state-of-the-art algorithms.

上一篇:Reducing Dueling Bandits to Cardinal Bandits

下一篇:The Coherent Loss Function for Classification

用户评价
全部评价

热门资源

  • 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...