Efficient Graph-Based Active Learning with Probit Likelihood via Gaussian Approximations

07/21/2020
by   Kevin Miller, et al.
2

We present a novel adaptation of active learning to graph-based semi-supervised learning (SSL) under non-Gaussian Bayesian models. We present an approximation of non-Gaussian distributions to adapt previously Gaussian-based acquisition functions to these more general cases. We develop an efficient rank-one update for applying "look-ahead" based methods as well as model retraining. We also introduce a novel "model change" acquisition function based on these approximations that further expands the available collection of active learning acquisition functions for such methods.

READ FULL TEXT
research
10/14/2021

Model-Change Active Learning in Graph-Based Semi-Supervised Learning

Active learning in semi-supervised classification involves introducing a...
research
03/31/2022

Graph-based Active Learning for Semi-supervised Classification of SAR Data

We present a novel method for classification of Synthetic Aperture Radar...
research
03/18/2022

Look-Ahead Acquisition Functions for Bernoulli Level Set Estimation

Level set estimation (LSE) is the problem of identifying regions where a...
research
03/27/2019

Active Multi-Information Source Bayesian Quadrature

Bayesian quadrature (BQ) is a sample-efficient probabilistic numerical m...
research
10/27/2022

Poisson Reweighted Laplacian Uncertainty Sampling for Graph-based Active Learning

We show that uncertainty sampling is sufficient to achieve exploration v...
research
09/03/2016

Graph-Based Active Learning: A New Look at Expected Error Minimization

In graph-based active learning, algorithms based on expected error minim...
research
11/06/2019

Assessing the Frontier: Active Learning, Model Accuracy, and Multi-objective Materials Discovery and Optimization

Discovering novel materials can be greatly accelerated by iterative mach...

Please sign up or login with your details

Forgot password? Click here to reset