Reducing Disparate Exposure in Ranking: A Learning To Rank Approach

被引:83
|
作者
Zehlike, Meike [1 ]
Castillo, Carlos [2 ]
机构
[1] Humboldt Univ, Max Planck Inst Software Syst, Berlin, Germany
[2] Univ Pompeu Fabra, Barcelona, Spain
关键词
Ranking; Algorithmic Fairness; Disparate Impact;
D O I
10.1145/3366424.3380048
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Ranked search results have become the main mechanism by which we find content, products, places, and people online. Thus their ordering contributes not only to the satisfaction of the searcher, but also to career and business opportunities, educational placement, and even social success of those being ranked. Researchers have become increasingly concerned with systematic biases in data-driven ranking models, and various post-processing methods have been proposed to mitigate discrimination and inequality of opportunity. This approach, however, has the disadvantage that it still allows an unfair ranking model to be trained. In this paper we explore a new in processing approach: DELTR, a learning-to-rank framework that addresses potential issues of discrimination and unequal opportunity in rankings at training time. We measure these problems in terms of discrepancies in the average group exposure and design a ranker that optimizes search results in terms of relevance and in terms of reducing such discrepancies. We perform an extensive experimental study showing that being "colorblind" can be among the best or the worst choices from the perspective of relevance and exposure, depending on how much and which kind of bias is present in the training set. We show that our in-processing method performs better in terms of relevance and exposure than a pre-processing and a post-processing method across all tested scenarios.
引用
收藏
页码:2849 / 2855
页数:7
相关论文
共 50 条
  • [1] ENSEMBLE RANKING SVM FOR LEARNING TO RANK
    Jung, Cheolkon
    Jiao, L. C.
    Shen, Yanbo
    2011 IEEE INTERNATIONAL WORKSHOP ON MACHINE LEARNING FOR SIGNAL PROCESSING (MLSP), 2011,
  • [2] Learning to Rank with Ensemble Ranking SVM
    Jung, Cheolkon
    Shen, Yanbo
    Jiao, Licheng
    NEURAL PROCESSING LETTERS, 2015, 42 (03) : 703 - 714
  • [3] Learning to Rank with Ensemble Ranking SVM
    Cheolkon Jung
    Yanbo Shen
    Licheng Jiao
    Neural Processing Letters, 2015, 42 : 703 - 714
  • [4] Fairer Together: Mitigating Disparate Exposure in Kemeny Rank Aggregation
    Cachel, Kathleen
    Rundensteiner, Elke
    PROCEEDINGS OF THE 6TH ACM CONFERENCE ON FAIRNESS, ACCOUNTABILITY, AND TRANSPARENCY, FACCT 2023, 2023, : 1347 - 1357
  • [5] Hybrid Learning to Rank for Financial Event Ranking
    Feng, Fuli
    Li, Moxin
    Luo, Cheng
    Ng, Ritchie
    Chua, Tat-Seng
    SIGIR '21 - PROCEEDINGS OF THE 44TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2021, : 233 - 243
  • [6] On Application of Learning to Rank for Assets Management: Warehouses Ranking
    Pongpech, Worapol Alex
    INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING - IDEAL 2018, PT I, 2018, 11314 : 336 - 343
  • [7] RANKING AUTHORS WITH LEARNING-TO-RANK TOPIC MODELING
    Yang, Zaihan
    Hong, Liangjie
    Yin, Dawei
    Davison, Brian D.
    INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2015, 11 (04): : 1295 - 1316
  • [8] Direct Optimization of Ranking Measures for Learning to Rank Models
    Tan, Ming
    Xia, Tian
    Guo, Lily
    Wang, Shaojun
    19TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING (KDD'13), 2013, : 856 - 864
  • [9] SQL-Rank: A Listwise Approach to Collaborative Ranking
    Wu, Liwei
    Hsieh, Cho-Jui
    Sharpnack, James
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 80, 2018, 80
  • [10] Learning to Rank for Search Results Re-ranking in Learning Experience Platforms
    Kataria, Ayush
    Venkateshprasanna, H. M.
    Kummetha, Ashok Kumar Reddy
    PROCEEDINGS OF THE 16TH ANNUAL ACM INDIA COMPUTE CONFERENCE, COMPUTE 2023, 2023, : 25 - 30