Anomaly-ranked confirmation slows new-class learning
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.
Authors
- A. Sasli (ORCID: https://orcid.org/0000-0001-7357-0889)
- Michael Coughlin
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-02
- DOI
- https://doi.org/10.48550/arxiv.2611.03250
- Primary Topic
- Anomaly Detection Techniques and Applications
- Type
- preprint