Skip to yearly menu bar Skip to main content


Computational and Statistical Tradeoffs in Learning to Rank

Ashish Khetan · Sewoong Oh

Area 5+6+7+8 #10

Keywords: [ Ranking and Preference Learning ] [ Convex Optimization ]


For massive and heterogeneous modern data sets, it is of fundamental interest to provide guarantees on the accuracy of estimation when computational resources are limited. In the application of learning to rank, we provide a hierarchy of rank-breaking mechanisms ordered by the complexity in thus generated sketch of the data. This allows the number of data points collected to be gracefully traded off against computational resources available, while guaranteeing the desired level of accuracy. Theoretical guarantees on the proposed generalized rank-breaking implicitly provide such trade-offs, which can be explicitly characterized under certain canonical scenarios on the structure of the data.

Live content is unavailable. Log in and register to view live content