Time- and Label-efficient Active Learning by Diversity and Uncertainty of Probabilities
gilhuber@dbs.ifi.lmu.de, Anna Beer, Yunpu Ma, Thomas Seidl
OpenReview ground truth
TL;DR — We propose FALCUN, a novel deep batch active learning method that is label- and time-efficient by exploiting diversity and uncertainty in the probability space.
Abstract
We propose FALCUN, a novel deep batch active learning method that is label- and time-efficient. Our proposed acquisition uses a natural, self-adjusting balance of uncertainty and diversity: It slowly transitions from emphasizing uncertain instances at the decision boundary to emphasizing batch diversity. In contrast, established deep active learning methods often have a fixed weighting of uncertainty and diversity. Moreover, most methods demand intensive search through a deep neural network's high-dimensional latent embedding space. This leads to high acquisition times during which experts are idle as they wait for the next batch to label. We overcome this structural problem by exclusively operating on the low-dimensional probability space, yielding much faster acquisition times. In extensive experiments, we show FALCUNs suitability for diverse use cases, including image and tabular data. Compared to state-of-the-art methods like BADGE, CLUE, and AlfaMix, FALCUN consistently excels in quality and speed: while FALCUN is among the fastest methods, it has the highest average label efficiency.
Author context
Most prolific author: 2 submissions (credibility 1.00).
No mass-submission penalty for this paper (authors within normal submission volume).
Aggregate statistics only — no individual author rankings.
Ranking trajectory
Percentile by tournament round — convergence indicates rating stability.
Battle history — 34 comparisons
Ranked above opponent in 52% of matchups.
- ▼ lost to Learning 3D Particle-based Simulators from… ×4
- ▲ beat Semi-HyperGraph Benchmark: Enhancing Flexi… ×4
- ▲ beat Instructive Decoding: Instruction-Tuned La… ×4
- ▼ lost to Effective pruning of web-scale datasets ba… ×4
- ▲ beat OrthCaps: An Orthogonal CapsNet with Spars… ×4
Judge assessments
Mean overall score 0.0 ± 0.0 (n = 34)