Search Improves Label for Active Learning

02/23/2016
by   Alina Beygelzimer, et al.
0

We investigate active learning with access to two distinct oracles: Label (which is standard) and Search (which is not). The Search oracle models the situation where a human searches a database to seed or counterexample an existing solution. Search is stronger than Label while being natural to implement in many situations. We show that an algorithm using both oracles can provide exponentially large problem-dependent improvements over Label alone.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/22/2020

SoQal: Selective Oracle Questioning in Active Learning

Large sets of unlabelled data within the healthcare domain remain underu...
research
05/29/2019

The Label Complexity of Active Learning from Observational Data

Counterfactual learning from observational data involves learning a clas...
research
10/15/2022

Active Learning with Neural Networks: Insights from Nonparametric Statistics

Deep neural networks have great representation power, but typically requ...
research
11/19/2013

Beating the Minimax Rate of Active Learning with Prior Knowledge

Active learning refers to the learning protocol where the learner is all...
research
11/20/2018

Computer-Assisted Fraud Detection, From Active Learning to Reward Maximization

The automatic detection of frauds in banking transactions has been recen...
research
07/16/2020

Active Learning under Label Shift

Distribution shift poses a challenge for active data collection in the r...
research
06/11/2021

Nonmyopic Multifidelity Active Search

Active search is a learning paradigm where we seek to identify as many m...

Please sign up or login with your details

Forgot password? Click here to reset