The learning-to-rank problem aims at ranking items to maximize exposure of those most relevant to a user query. A desirable property of such ranking systems is to guarantee some notion of fairness among specified item groups. While fairness has recently been considered in the context of learning-to-rank systems, current methods cannot provide guarantees on the fairness of the predicted rankings. This paper addresses this gap and introduces Smart Predict and Optimize for Fair Ranking (SPOFR), an integrated optimization and learning framework for fairness-constrained learning to rank. The end-to-end SPOFR framework includes a constrained optimization sub-model and produces ranking policies that are guaranteed to satisfy fairness constraints, while allowing for fine control of the fairness-utility tradeoff. SPOFR is shown to significantly improve on current state-of-the-art fair learning-to-rank systems with respect to established performance metrics.
CITATION STYLE
Kotary, J., Fioretto, F., Van Hentenryck, P., & Zhu, Z. (2022). End-to-End Learning for Fair Ranking Systems. In WWW 2022 - Proceedings of the ACM Web Conference 2022 (pp. 3520–3530). Association for Computing Machinery, Inc. https://doi.org/10.1145/3485447.3512247
Mendeley helps you to discover research relevant for your work.