On the Sample Complexity of Rank Regression from Pairwise Comparisons

05/04/2021

∙

by   Berkan Kadioglu, et al.

∙

0

∙

share

We consider a rank regression setting, in which a dataset of N samples with features in ℝ^d is ranked by an oracle via M pairwise comparisons. Specifically, there exists a latent total ordering of the samples; when presented with a pair of samples, a noisy oracle identifies the one ranked higher with respect to the underlying total ordering. A learner observes a dataset of such comparisons and wishes to regress sample ranks from their features. We show that to learn the model parameters with ϵ > 0 accuracy, it suffices to conduct M ∈Ω(dNlog^3 N/ϵ^2) comparisons uniformly at random when N is Ω(d/ϵ^2).