Active Learning for Top-$K$ Rank Aggregation from Noisy Comparisons

摘要

We explore an active top-$K$ ranking problem based on pairwise comparisons that are collected possibly in a sequential manner as per our design choice. We consider two settings: (1)