Zero-shot CLIP pre-ordering plus uncertainty-guided MergeSort reduces human pairwise-comparison annotations by up to 90.5% and by 19.8% over prior active sorting.
An $O(N)$ Sorting Algorithm: Machine Learning Sort
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We propose an $O(N\cdot M)$ sorting algorithm by Machine Learning method, which shows a huge potential sorting big data. This sorting algorithm can be applied to parallel sorting and is suitable for GPU or TPU acceleration. Furthermore, we discuss the application of this algorithm to sparse hash table.
citation-role summary
background 1
citation-polarity summary
fields
cs.CV 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
EZ-Sort: Efficient Pairwise Comparison via Zero-Shot CLIP-Based Pre-Ordering and Human-in-the-Loop Sorting
Zero-shot CLIP pre-ordering plus uncertainty-guided MergeSort reduces human pairwise-comparison annotations by up to 90.5% and by 19.8% over prior active sorting.