Timezone: »
In this paper, we formulate a novel problem of learning to select a set of items maximizing the quality of their ordered list, where the order is predefined by some explicit rule. Unlike the classic information retrieval problem, in our setting, the predefined order of items in the list may not correspond to their quality in general. For example, this is a dominant scenario in personalized news and social media feeds, where items are ordered by publication time in a user interface. We propose new theoretically grounded algorithms based on direct optimization of the resulting list quality. Our offline and online experiments with a large-scale product search engine demonstrate the overwhelming advantage of our methods over the baselines in terms of all key quality metrics.
Author Information
Aleksei Ustimenko (Yandex)
Aleksandr Vorobev (Yandex)
Gleb Gusev (Yandex)
Pavel Serdyukov (Yandex)
Related Events (a corresponding poster, oral, or spotlight)
-
2019 Poster: Learning to select for a predefined ranking »
Fri Jun 14th 01:30 -- 04:00 AM Room Pacific Ballroom
More from the Same Authors
-
2021 Poster: SGLB: Stochastic Gradient Langevin Boosting »
Aleksei Ustimenko · Liudmila Prokhorenkova -
2021 Spotlight: SGLB: Stochastic Gradient Langevin Boosting »
Aleksei Ustimenko · Liudmila Prokhorenkova -
2020 Poster: StochasticRank: Global Optimization of Scale-Free Discrete Functions »
Aleksei Ustimenko · Liudmila Prokhorenkova -
2018 Poster: Finding Influential Training Samples for Gradient Boosted Decision Trees »
Boris Sharchilev · Yury Ustinovskiy · Pavel Serdyukov · Maarten de Rijke -
2018 Oral: Finding Influential Training Samples for Gradient Boosted Decision Trees »
Boris Sharchilev · Yury Ustinovskiy · Pavel Serdyukov · Maarten de Rijke