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

Arun Rajkumar, Shivani Agarwal 0001. When can we rank well from comparisons of \(O(n\log(n))\) non-actively chosen pairs?. In Vitaly Feldman, Alexander Rakhlin, Ohad Shamir, editors, Proceedings of the 29th Conference on Learning Theory, COLT 2016, New York, USA, June 23-26, 2016. Volume 49 of JMLR Workshop and Conference Proceedings, pages 1376-1401, JMLR.org, 2016. [doi]

Abstract

Abstract is missing.