PaperScope
LIVE · 2026-11-03 05:40 UTC

Anomaly-ranked confirmation slows new-class learning

Argyro Sasli, Michael Coughlin

Latestcs.CLcs.LGcs.AIcs.CV
arXiv ID
2611.03250 v1
Submitted
2026-11-02

Abstract

Anomaly detectors rank unfamiliar examples for expert confirmation, and the confirmed examples teach a classifier to recognise a new class. Across five benchmarks from physics, medicine and computer vision, the members flagged by the detector are those the classifier learns first. In three systems, confirming the highest-ranked members of a new class gives lower recognition than confirming the same number of random members. Handing subsequent selection to the promoted classifier recovers part of this loss in two systems. A paired intervention further shows that replacing nearby known classes with distant ones sharply reduces the confirmations needed for recognition. These results distinguish finding a new class from selecting examples that teach its extent: within the tested classes, concentrating confirmations at the top of the anomaly ranking makes learning less efficient.

Comment: 9 pages, 4 figures

arXiv abs page · PDF · same-day batch