Evaluating Stochastic Rankings with Expected Exposure
- Fernando Diaz ,
- Bhaskar Mitra ,
- Michael D. Ekstrand ,
- Asia J. Biega ,
- Ben Carterette
Proceedings of the 29th ACM International Conference on Information and Knowledge Management (CIKM) |
Published by ACM - Association for Computing Machinery
Best Long Research Paper Nominee
Download BibTexWe introduce the concept of expected exposure as the average attention ranked items receive from users over repeated samples of the same query. Furthermore, we advocate for the adoption of the principle of equal expected exposure: given a fixed information need, no item receive more or less expected exposure compared to any other item of the same relevance grade. We argue that this principle is desirable for many retrieval objectives and scenarios, including topical diversity and fair ranking. Leveraging user models from existing retrieval metrics, we propose a general evaluation methodology based on expected exposure and draw connections to related metrics in information retrieval evaluation. Importantly, this methodology relaxes classic information retrieval assumptions, allowing a system, in response to a query, to produce a distribution over rankings instead of a single fixed ranking. We study the behavior of the expected exposure metric and stochastic rankers across a variety of information access conditions, including ad hoc retrieval and recommendation. We believe that measuring and optimizing expected exposure metrics using randomization opens a new area for retrieval algorithm development and progress.