EZ-Sort: Efficient Pairwise Comparison via Zero-Shot CLIP-Based Pre-Ordering and Human-in-the-Loop Sortingopen access
- Authors
- Park, Yujin; Chung, Haejun; Jang, Ikbeom
- Issue Date
- Nov-2025
- Publisher
- Association for Computing Machinery, Inc
- Keywords
- annotation; human-in-the-loop sorting; labeling; pairwise comparison; vlm-based pre-ordering
- Citation
- CIKM 2025 - Proceedings of the 34th ACM International Conference on Information and Knowledge Management, pp 5120 - 5124
- Pages
- 5
- Indexed
- SCOPUS
- Journal Title
- CIKM 2025 - Proceedings of the 34th ACM International Conference on Information and Knowledge Management
- Start Page
- 5120
- End Page
- 5124
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/209903
- DOI
- 10.1145/3746252.3760848
- Abstract
- Pairwise comparison is often favored over absolute rating or ordinal classification in subjective or difficult annotation tasks due to its improved reliability. However, exhaustive comparisons require a massive number of annotations (O(n²)). Recent work[8] has reduced the annotation burden (O(n log n)) by actively sampling pairwise comparisons using a sorting algorithm. We further improve annotation efficiency by (1) roughly pre-ordering items using the CLIP (Contrastive Language-Image Pre-training) model hierarchically without training, and (2) replacing easy, obvious human comparisons with automated ones. The proposed EZ-Sort first produces a CLIP-based zero-shot pre-ordering, then initializes bucket-aware Elo scores, and finally runs an uncertainty-guided human-in-the-loop MergeSort. We validated our method using datasets from three domains: face-age estimation (FGNET)[10], historical image chronology (DHCI)[14], and retinal image quality assessment (EyePACS)[6]. EZ-Sort reduced human annotation cost by 90.5% compared to exhaustive pairwise comparisons and by 19.8% compared to prior work[8] (at n = 100), while improving or maintaining inter-rater reliability. These results demonstrate that combining CLIP-based priors with uncertainty-aware sampling yields an efficient and scalable solution for pairwise ranking.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 융합전자공학부 > 1. Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.