Active learning is planning: Nonmyopic ε-Bayes-optimal active learning of Gaussian processes

22Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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

Cite

CITATION STYLE

APA

Hoang, T. N., Low, K. H., Jaillet, P., & Kankanhalli, M. (2014). Active learning is planning: Nonmyopic ε-Bayes-optimal active learning of Gaussian processes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8726 LNAI, pp. 494–498). Springer Verlag. https://doi.org/10.1007/978-3-662-44845-8_43

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free