astro-ph.IMNov 2, 2026

Anomaly-ranked confirmation slows new-class learning

Authors: Argyro Sasli, Michael Coughlin

Organizations: School of Physics and Astronomy, University of Minnesota, Minneapolis, MN 55455, USA

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.

Figures & tables

Explore similar work

CardsList
  1. Beyond Normal References: Discriminative Few-Shot Anomaly Detection

    May 22, 2026Huan Wang, Jun Shen, Jun Yan +1Few-Shot Anomaly DetectionFew-Shot Learning

  2. How Far Can Untrained Neural Networks Go in Anomaly Detection? From Tables to Pixels

    Nov 5, 2026Hyojun Yi, Geunyoung Kim, Hogeon Seo +1Anomaly DetectionUnsupervised Anomaly Detection

  3. Trivial Graph Features and Classical Learning are Enough to Detect Random Anomalies

    Mar 2, 2026Matthieu Latapy, Stephany RajehLogical Anomaly DetectionAnomaly Detection