mlsanityData to 14 Oct 2026

FunnelAL: Retrieve-then-Rank Active Learning for Single-Class Discovery

arXiv 2607.25276 ↗First posted 28 Jul 2026cs.CV cs.IR cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

We present FunnelAL, a retrieve-then-rank active learning system for single-class discovery, which adapts the multi-stage funnel architecture of industrial recommender systems to data annotation. Large-scale supervised learning faces two challenges: efficiently finding relevant samples in a massive corpus, and distinguishing true positives from visually confusable negatives when embeddings do not cleanly separate classes. Conventional active learning offers a principled framework for reducing annotation cost, yet it treats sample selection as a single-stage process that addresses neither challenge efficiently. FunnelAL decomposes the problem into cascaded stages. Starting from a single positive and negative example, the system iterates through: (1) embedding-based retrieval scoring that narrows the corpus to a manageable candidate set; (2) a precision-triggered ranking stage that exploits a learned ranker (RankNet) while batch precision remains high, then automatically blends in committee-based exploration (QBC) once returns diminish; and (3) feedback from the annotator's labels that refines both stages in subsequent iterations. We evaluate on three diverse image classification benchmarks. With a perfect annotator, FunnelAL attains the best final F1 on all three benchmarks, the best annotation efficiency (first in AULC), and the fewest annotation rounds. The most recent single-class discovery methods (GAL, PF-MA) at best match its final quality, and only at consistently higher labeling cost. Under annotator labeling errors at realistic rates, FunnelAL remains first or statistically tied for first while classical uncertainty-based methods degrade two to three times faster. Our work provides a concrete bridge between multi-stage recommender systems and active learning.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 26 of its 58 references that are in the map. First posted on arXiv 28 Jul 2026.

Builds on

26 of 58 references.

References · 26

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2017Billion-scale similarity search with GPUscited by 2,497
  3. 2013Fine-Grained Visual Classification of Aircraftcited by 1,726
  4. 2018Learning from positive and unlabeled data: a surveycited by 219
  5. 2021A Survey of Human-in-the-loop for Machine Learningcited by 215
  6. 2018xView: Objects in Context in Overhead Imagerycited by 146
  7. 2022Active Learning on a Budget: Opposite Strategies Suit High and Low Budgetscited by 133
  8. 2021Batch Active Learning at Scalecited by 127
  9. 2021Advances and Challenges in Conversational Recommender Systems: A Surveycited by 118
  10. 2014Online Clustering of Banditscited by 102
  11. 2020Estimation-Action-Reflection: Towards Deep Interaction Between Conversational and Recommender Systemscited by 98
  12. 2022Active Learning Through a Covering Lenscited by 66
14 more
  1. 2022GALAXY: Graph-based Active Learning at the Extremecited by 29
  2. 2021A survey of active learning algorithms for supervised remote sensing image classificationcited by 27
  3. 2020Similarity Search for Efficient Active Learning and Search of Rare Conceptscited by 24
  4. 2022DIAL: Deep Interactive and Active Learning for Semantic Segmentation in Remote Sensingcited by 17
  5. 2023Long-Term Value of Exploration: Measurements, Findings and Algorithmscited by 13
  6. 2020Empowering Active Learning to Jointly Optimize System and User Demandscited by 10
  7. 2019Human-Machine Collaboration for Fast Land Cover Mappingcited by 9
  8. 2024AnchorAL: Computationally Efficient Active Learning for Large and Imbalanced Datasetscited by 5
  9. 2024Active Learning via Classifier Impact and Greedy Selection for Interactive Image Retrievalcited by 5
  10. 2021Multi-Step Critiquing User Interface for Recommender Systemscited by 3
  11. 2023Learning to Rank for Active Learning via Multi-Task Bilevel Optimizationcited by 3
  12. 2022A Simple yet Effective Framework for Active Learning to Rankcited by 2
  13. 2025Learning Cascade Ranking as One Networkcited by 2
  14. 2026Positive-First Most Ambiguous: A Simple Active Learning Criterion for Interactive Retrieval of Rare Categoriescited by 2

Built on by

Not cited yet.