Sorted Top-k in Rounds

COLT, pp. 342-382, 2019.

Cited by: 2|Bibtex|Views43
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|arxiv.org

Abstract:

We consider the sorted top-$k$ problem whose goal is to recover the top-$k$ items with the correct order out of $n$ items using pairwise comparisons. In many applications, multiple rounds of interaction can be costly. We restrict our attention to algorithms with a constant number of rounds $r$ and try to minimize the sample complexity, ...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments