# EZ-Sort: Efficient Pairwise Comparison via Zero-Shot CLIP-Based Pre-Ordering and Human-in-the-Loop Sorting

**Authors:** Yujin Park, Haejun Chung, Ikbeom Jang

arXiv: 2508.21550 · 2025-09-01

## TL;DR

EZ-Sort combines zero-shot CLIP-based pre-ordering with human-in-the-loop sorting to significantly reduce annotation costs in pairwise comparison tasks, maintaining high reliability.

## Contribution

It introduces a novel method that leverages CLIP for pre-ordering and automates easy comparisons, reducing human effort in pairwise ranking tasks.

## Key findings

- Reduced human annotation cost by 90.5% compared to exhaustive methods
- Achieved 19.8% cost reduction over prior work for n=100
- Maintained or improved inter-rater reliability

## 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^2)). Recent work has greatly 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 Contrastive Language-Image Pre-training (CLIP) model hierarchically without training, and (2) replacing easy, obvious human comparisons with automated comparisons. 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. Validation was conducted using various datasets: face-age estimation (FGNET), historical image chronology (DHCI), and retinal image quality assessment (EyePACS). It showed that EZ-Sort reduced human annotation cost by 90.5% compared to exhaustive pairwise comparisons and by 19.8% compared to prior work (when 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.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/2508.21550/full.md

## Figures

2 figures with captions in the complete paper: https://tomesphere.com/paper/2508.21550/full.md

## References

37 references — full list in the complete paper: https://tomesphere.com/paper/2508.21550/full.md

---
Source: https://tomesphere.com/paper/2508.21550