- Query-level Ranker Specialization
- CEUR Workshop Proceedings
- Number of pages
- Document type
- Faculty of Science (FNWI)
- Informatics Institute (IVI)
Traditional Learning to Rank models optimize a single ranking function for all available queries. This assumes that all queries come from a homogenous source. Instead, it seems reasonable to assume that queries originate from heterogenous sources, where certain queries may require documents to be ranked differently. We introduce the Specialized Ranker Model which assigns queries to different rankers that become specialized on a subset of the available queries. We provide a theoretical foundation for this model starting from the listwise Plackett-Luce ranking model and derive a computationally feasible expectation-maximization procedure to infer the model's parameters. Furthermore we experiment using a noisy oracle to model the risk/reward tradeoff that exists when deciding which specialized ranker to use for unseen queries.
- Final publisher version
- Other links
- issue contents
- LEARNER 2017 : LEARning Next gEneration Rankers : proceedings of the 1st International Workshop on LEARning Next gEneration
co-located with the 3rd ACM International Conference on the Theory of Information Retrieval (ICTIR 2017) : Amsterdam, The Netherlands, October 1, 2017.
Edited by Nicola Ferro, Claudio Lucchese, Maria Maistro & Raffaele Perego.
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.