Affiliation:
1. IDLab, Department of Electronics and Information Systems, Ghent University, Ghent, Belgium
Abstract
Recommendation in settings such as e-recruitment and online dating involves distributing limited opportunities, which differs from recommending practically unlimited goods such as in e-commerce or music recommendation. This setting calls for novel approaches to quantify and enforce fairness. Indeed, typical recommender systems recommend each user their top relevant items, such that desirable items may be recommended simultaneously to more and to less qualified individuals. This is arguably unfair to the latter. Indeed, when they pursue such a desirable recommendation (e.g., by applying for a job), they are unlikely to be successful.
To quantify fairness in such settings, we introduce
inferiority
: a novel (un)fairness measure that quantifies the competitive disadvantage of a user for their recommended items. Inferiority is complementary to
envy
: a previously-proposed fairness notion that quantifies the extent to which a user prefers other users’ recommendations over their own. We propose to use both inferiority and envy in combination with an accuracy-related measure called
utility
: the aggregated relevancy scores of the recommended items. Unfortunately, none of these three measures are differentiable, making it hard to optimize them, and restricting their immediate use to evaluation only. To remedy this, we reformulate them in the context of a probabilistic interpretation of recommender systems, resulting in differentiable versions. We show how these loss functions can be combined in a multi-objective optimization problem that we call FEIR (Fairness through Envy and Inferiority Reduction), used as a post-processing of the scores from any standard recommender system.
Experiments on synthetic and real-world data show that the proposed approach effectively improves the trade-offs between inferiority, envy and utility, compared to the naive recommendation and the state-of-the-art method for the related problem of congestion alleviation in job recommendation. We discuss and enhance the practical impact of our findings on a wide range of real-world recommendation scenarios, and we offer implementations of visualization tools to render the envy and inferiority metrics more accessible.
Funder
European Research Council under the European Union’s Seventh Framework Programme
ERC Grant Agreement
European Union’s Horizon 2020 research and innovation programme
Special Research Fund (BOF) of Ghent University
Flemish Government under the “Onderzoeksprogramma Artificiële Intelligentie (AI) Vlaanderen” programme, and from the FWO
Publisher
Association for Computing Machinery (ACM)
Reference34 articles.
1. Himan Abdollahpouri Gediminas Adomavicius Robin Burke Ido Guy Dietmar Jannach Toshihiro Kamishima Jan Krasnodebski and Luiz Pizzato. 2020. Multistakeholder recommendation: Survey and research directions. User Modeling and User-Adapted Interaction 30 1 (March2020) 127–158. DOI:10.1007/s11257-019-09256-1
2. Gediminas Adomavicius and YoungOk Kwon. 2011. Maximizing aggregate recommendation diversity: A graph-theoretic approach. In Proc. of the 1st International Workshop on Novelty and Diversity in Recommender Systems (DiveRS 2011). Citeseer, 3–10.
3. Guillaume Bied, Elia Perennes, Victor Naya, Philippe Caillou, Bruno Crépon, Christophe Gaillac, and Michele Sebag. 2021. Congestion-avoiding job recommendation with optimal transport. In FEAST Workshop ECML-PKDD 2021.
4. Maarten Buyl and Tijl De Bie. 2024. Inherent limitations of AI fairness. Commun. ACM 2024.
5. Laurent Charlin and Richard Zemel. 2013. The Toronto paper matching system: An automated paper-reviewer assignment system. In ICML Workshop on Peer Reviewing and Publishing Models (PEER’13).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献