Active learning using region-based sampling

Sanjoy Dasgupta, Yoav Freund
3/5/2023
cs.LG

No confident code implementation found for this paper. 2 possible matches can be shown below.

Abstract

We present a general-purpose active learning scheme for data in metric spaces. The algorithm maintains a collection of neighborhoods of different sizes and uses label queries to identify those that have a strong bias towards one particular label; when two such neighborhoods intersect and have different labels, the region of overlap is treated as a ``known unknown'' and is a target of future active queries. We give label complexity bounds for this method that do not rely on assumptions about the data and we instantiate them in several cases of interest.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{dasgupta2023active,
  title  = {Active learning using region-based sampling},
  author = {Sanjoy Dasgupta and Yoav Freund},
  year   = {2023},
  eprint = {2303.02721},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2303.02721v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2303.02721.svg)](https://codeofpaper.com/paper/2303.02721)

Discussion