English

QuMAB: Query-based Multi-Annotator Behavior Modeling with Reliability under Sparse Labels

Multimedia 2025-08-08 v2 Information Retrieval

Abstract

Multi-annotator learning traditionally aggregates diverse annotations to approximate a single ground truth, treating disagreements as noise. However, this paradigm faces fundamental challenges: subjective tasks often lack absolute ground truth, and sparse annotation coverage makes aggregation statistically unreliable. We introduce a paradigm shift from sample-wise aggregation to annotator-wise behavior modeling. By treating annotator disagreements as valuable information rather than noise, modeling annotator-specific behavior patterns can reconstruct unlabeled data to reduce annotation cost, enhance aggregation reliability, and explain annotator decision behavior. To this end, we propose QuMAB (Query-based Multi-Annotator Behavior Pattern Learning), which uses light-weight queries to model individual annotators while capturing inter-annotator correlations as implicit regularization, preventing overfitting to sparse individual data while maintaining individualization and improving generalization, with a visualization of annotator focus regions offering an explainable analysis of behavior understanding. We contribute two large-scale datasets with dense per-annotator labels: STREET (4,300 labels/annotator) and AMER (average 3,118 labels/annotator), the first multimodal multi-annotator dataset. Extensive experiments demonstrate the superiority of our QuMAB in modeling individual annotators' behavior patterns, their utility for consensus prediction, and applicability under sparse annotations.

Keywords

Cite

@article{arxiv.2507.17653,
  title  = {QuMAB: Query-based Multi-Annotator Behavior Modeling with Reliability under Sparse Labels},
  author = {Liyun Zhang and Zheng Lian and Hong Liu and Takanori Takebe and Yuta Nakashima},
  journal= {arXiv preprint arXiv:2507.17653},
  year   = {2025}
}

Comments

12 pages. arXiv admin note: substantial text overlap with arXiv:2503.15237

R2 v1 2026-07-01T04:15:34.589Z