mlsanityData to 7 Oct 2026

Probabilistic Active Learning for Active Class Selection

arXiv 2108.03891 ↗First posted 9 Aug 2021cs.LG cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

In machine learning, active class selection (ACS) algorithms aim to actively select a class and ask the oracle to provide an instance for that class to optimize a classifier's performance while minimizing the number of requests. In this paper, we propose a new algorithm (PAL-ACS) that transforms the ACS problem into an active learning task by introducing pseudo instances. These are used to estimate the usefulness of an upcoming instance for each class using the performance gain model from probabilistic active learning. Our experimental evaluation (on synthetic and real data) shows the advantages of our algorithm compared to state-of-the-art algorithms. It effectively prefers the sampling of difficult classes and thereby improves the classification performance.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 0 of its 17 references that are in the map. First posted on arXiv 9 Aug 2021.

Builds on

0 of 17 references.

No references here yet.

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 0; 2025: 1.

2 papers.