Diameter-Based Active Learning

02/27/2017
by   Christopher Tosh, et al.
0

To date, the tightest upper and lower-bounds for the active learning of general concept classes have been in terms of a parameter of the learning problem called the splitting index. We provide, for the first time, an efficient algorithm that is able to realize this upper bound, and we empirically demonstrate its good performance.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/24/2022

Active Learning Polynomial Threshold Functions

We initiate the study of active learning polynomial threshold functions ...
research
04/06/2021

Low-Regret Active learning

We develop an online learning algorithm for identifying unlabeled data p...
research
05/15/2020

Stopping criterion for active learning based on deterministic generalization bounds

Active learning is a framework in which the learning machine can select ...
research
06/22/2020

Effective Version Space Reduction for Convolutional Neural Networks

In active learning, sampling bias could pose a serious inconsistency pro...
research
07/22/2023

Sparse Index Tracking: Simultaneous Asset Selection and Capital Allocation via ℓ_0-Constrained Portfolio

Sparse index tracking is one of the prominent passive portfolio manageme...
research
05/27/2016

Asymptotic Analysis of Objectives based on Fisher Information in Active Learning

Obtaining labels can be costly and time-consuming. Active learning allow...
research
07/28/2019

Mindful Active Learning

We propose a novel active learning framework for activity recognition us...

Please sign up or login with your details

Forgot password? Click here to reset