When can we rank well from comparisons of \(O(n\log(n))\) non-actively chosen pairs?

Arun Rajkumar Shivani Agarwal

Published in: COLT (2016)

Keyphrases

active learning
pairwise
lower bound
worst case
data sets
rank aggregation
data mining
machine learning
artificial intelligence
computer vision
data structure
artificial neural networks
np hard
similarity scores
word pairs