Evaluating Stochastic Rankings with Expected Exposure

被引:101
作者
Diaz, Fernando [1 ]
Mitra, Bhaskar [1 ]
Ekstrand, Michael D. [2 ]
Biega, Asia J. [1 ]
Carterette, Ben [3 ]
机构
[1] Microsoft, Montreal, PQ, Canada
[2] Boise State Comp Sci, People & Informat Res Team, Boise, ID USA
[3] Spotify, New York, NY USA
来源
CIKM '20: PROCEEDINGS OF THE 29TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT | 2020年
基金
美国国家科学基金会;
关键词
evaluation; fairness; diversity;
D O I
10.1145/3340531.3411962
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We 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 should receive more or less expected exposure than 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.
引用
收藏
页码:275 / 284
页数:10
相关论文
共 49 条
  • [1] [Anonymous], 2010, ACM Conference on Recommender Systems
  • [2] Bengio Y, 2013, CoRR abs/1308.3432
  • [3] Fairness in Recommendation Ranking through Pairwise Comparisons
    Beutel, Alex
    Chen, Jilin
    Doshi, Tulsee
    Qian, Hai
    Wei, Li
    Wu, Yi
    Heldt, Lukasz
    Zhao, Zhe
    Hong, Lichan
    Chi, Ed H.
    Goodrow, Cristos
    [J]. KDD'19: PROCEEDINGS OF THE 25TH ACM SIGKDD INTERNATIONAL CONFERENCCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2019, : 2212 - 2220
  • [4] Equity of Attention: Amortizing Individual Fairness in Rankings
    Biega, Asia J.
    Gummadi, Krishna P.
    Weikum, Gerhard
    [J]. ACM/SIGIR PROCEEDINGS 2018, 2018, : 405 - 414
  • [5] A Stochastic Treatment of Learning to Rank Scoring Functions
    Bruch, Sebastian
    Han, Shuguang
    Bendersky, Michael
    Najork, Marc
    [J]. PROCEEDINGS OF THE 13TH INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING (WSDM '20), 2020, : 61 - 69
  • [6] Burges C. J. C., 2005, P 22 INT C MACH LEAR, P89
  • [7] Burke R., 2017, ARXIV170700093 CS
  • [8] How Algorithmic Confounding in Recommendation Systems Increases Homogeneity and Decreases Utility
    Chaney, Allison J. B.
    Stewart, Brandon M.
    Engelhardt, Barbara E.
    [J]. 12TH ACM CONFERENCE ON RECOMMENDER SYSTEMS (RECSYS), 2018, : 224 - 232
  • [9] Chapelle Olivier, 2009, P 18 ACM C INFORM KN, P621, DOI [DOI 10.1145/1645953.1646033, 10.1145/1645953.1646033]
  • [10] Subset ranking using regression
    Cossock, David
    Zhang, Tong
    [J]. LEARNING THEORY, PROCEEDINGS, 2006, 4005 : 605 - 619