# Anomaly-ranked confirmation slows new-class learning

**Authors:** Argyro Sasli, Michael Coughlin  
**Lab:** University of Minnesota · **Published:** 2 Nov 2026  
**Links:** [arXiv](https://arxiv.org/abs/2611.03250) · [PDF](https://arxiv.org/pdf/2611.03250) · [This page](https://omen-bit.github.io/ai-paper-daily/paper/2611.03250.html)

## 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.

---

Notes written by AI from the paper, numbers copied from the abstract. Check the paper before you rely on them. From AI Papers Daily.