Efficient Active Learning for Gaussian Process Classification by Error Reduction
Dez 6, 2021
Sprecher:innen
Guang Zhao
Sprecher:in · 0 Follower:innen
Edward R. Dougherty
Sprecher:in · 0 Follower:innen
Byung-Jun Yoon
Sprecher:in · 0 Follower:innen
Francis J. Alexander
Sprecher:in · 0 Follower:innen
Xiaoning Qian
Sprecher:in · 0 Follower:innen
Über
Active learning sequentially selects the best instance for labeling by optimizing an acquisition function to enhance data/label efficiency. The selection can be either from a discrete instance set (pool-based scenario) or a continuous instance space (query synthesis scenario). In this work, we study both active learning scenarios for Gaussian Process Classification (GPC). The existing active learning strategies that maximize the Estimated Error Reduction (EER) aim at reducing the classification error after training with the new acquired instance in a one-step-look-ahead manner. The computation of EER-based acquisition functions is typically prohibitive as it requires retraining the GPC with every new query. Moreover, as the EER is not smooth, it can not be combined with gradient-based optimization techniques to efficiently explore the continuous instance space for query synthesis. To overcome these critical limitations, we develop computationally efficient algorithms for EER-based active learning with GPC. We derive the joint predictive distribution of label pairs as a one-dimensional integral, as a result of which the computation of the acquisition function avoids retraining the GPC for each query, remarkably reducing the computational overhead. We also derive the gradient chain rule to efficiently calculate the gradient of the acquisition function, which leads to the first query synthesis active learning algorithm implementing EER-based strategies. Our experiments clearly demonstrate the computational efficiency of the proposed algorithms. We also benchmark our algorithms on both synthetic and real-world datasets, which show superior performance in terms of sampling efficiency compared to the existing state-of-the-art algorithms.Active learning sequentially selects the best instance for labeling by optimizing an acquisition function to enhance data/label efficiency. The selection can be either from a discrete instance set (pool-based scenario) or a continuous instance space (query synthesis scenario). In this work, we study both active learning scenarios for Gaussian Process Classification (GPC). The existing active learning strategies that maximize the Estimated Error Reduction (EER) aim at reducing the classification…
Organisator
NeurIPS 2021
Konto · 1,9k Follower:innen
Über NeurIPS 2021
Neural Information Processing Systems (NeurIPS) is a multi-track machine learning and computational neuroscience conference that includes invited talks, demonstrations, symposia and oral and poster presentations of refereed papers. Following the conference, there are workshops which provide a less formal setting.
Gefällt euch das Format? Vertraut auf SlidesLive, um euer nächstes Event festzuhalten!
Professionelle Aufzeichnung und Livestreaming – weltweit.
Freigeben
Empfohlene Videos
Präsentationen, deren Thema, Kategorie oder Sprecher:in ähnlich sind
Permuton-induced Chinese Restaurant Process
Später ansehen
Ewigspeicher-Fortschrittswert: 0 = 0.0%
Bayesian Deep Learning
Später ansehen
Ewigspeicher-Fortschrittswert: 0 = 0.0%
Universal Graph Convolutional Networks
Später ansehen
Di Jin, …
Ewigspeicher-Fortschrittswert: 0 = 0.0%
Choice, Automation and Performance in ML Deployment with Apache TVM and OctoML
Später ansehen
Ewigspeicher-Fortschrittswert: 0 = 0.0%
Bandit Phase Retrieval
Später ansehen
Ewigspeicher-Fortschrittswert: 0 = 0.0%
CentripetalText: An Efficient Text Instance Representation for Scene Text Detection
Später ansehen
Tao Sheng, …
Ewigspeicher-Fortschrittswert: 0 = 0.0%