Regret-aware Re-ranking for Guaranteeing Two-sided Fairness and Accuracy in Recommender Systems

• URL: http://arxiv.org/abs/2504.14550v1
• Date: Sun, 20 Apr 2025 09:43:23 GMT
• Title: Regret-aware Re-ranking for Guaranteeing Two-sided Fairness and Accuracy in Recommender Systems
• Authors: Xiaopeng Ye, Chen Xu, Jun Xu, Xuyang Xie, Gang Wang, Zhenhua Dong,
• Abstract summary: In multi-stakeholder recommender systems, users and providers operate as two crucial and interdependent roles, whose interests must be well-balanced.<n>How to guarantee individual fairness while ensuring user accuracy and provider fairness remains an unsolved problem.<n>We propose our method BankFair+ to ensure individual fairness while enhancing user accuracy.
• Score: 18.08572059176545
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: In multi-stakeholder recommender systems (RS), users and providers operate as two crucial and interdependent roles, whose interests must be well-balanced. Prior research, including our work BankFair, has demonstrated the importance of guaranteeing both provider fairness and user accuracy to meet their interests. However, when they balance the two objectives, another critical factor emerges in RS: individual fairness, which manifests as a significant disparity in individual recommendation accuracy, with some users receiving high accuracy while others are left with notably low accuracy. This oversight severely harms the interests of users and exacerbates social polarization. How to guarantee individual fairness while ensuring user accuracy and provider fairness remains an unsolved problem. To bridge this gap, in this paper, we propose our method BankFair+. Specifically, BankFair+ extends BankFair with two steps: (1) introducing a non-linear function from regret theory to ensure individual fairness while enhancing user accuracy; (2) formulating the re-ranking process as a regret-aware fuzzy programming problem to meet the interests of both individual user and provider, therefore balancing the trade-off between individual fairness and provider fairness. Experiments on two real-world recommendation datasets demonstrate that BankFair+ outperforms all baselines regarding individual fairness, user accuracy, and provider fairness.

Related papers

• Emulating Full Participation: An Effective and Fair Client Selection Strategy for Federated Learning [50.060154488277036]
  In federated learning, client selection is a critical problem that significantly impacts both model performance and fairness.<n>We propose two guiding principles that tackle the inherent conflict between the two metrics while reinforcing each other.<n>Our approach adaptively enhances this diversity by selecting clients based on their data distributions, thereby improving both model performance and fairness.
  arXiv  Detail & Related papers  (2024-05-22T12:27:24Z)
• A Survey on Fairness-aware Recommender Systems [59.23208133653637]
  We present concepts of fairness in different recommendation scenarios, comprehensively categorize current advances, and introduce typical methods to promote fairness in different stages of recommender systems. Next, we delve into the significant influence that fairness-aware recommender systems exert on real-world industrial applications.
  arXiv  Detail & Related papers  (2023-06-01T07:08:22Z)
• Improving Recommendation Fairness via Data Augmentation [66.4071365614835]
  Collaborative filtering based recommendation learns users' preferences from all users' historical behavior data, and has been popular to facilitate decision making. A recommender system is considered unfair when it does not perform equally well for different user groups according to users' sensitive attributes. In this paper, we study how to improve recommendation fairness from the data augmentation perspective.
  arXiv  Detail & Related papers  (2023-02-13T13:11:46Z)
• Fairness in Matching under Uncertainty [78.39459690570531]
  algorithmic two-sided marketplaces have drawn attention to the issue of fairness in such settings. We axiomatize a notion of individual fairness in the two-sided marketplace setting which respects the uncertainty in the merits. We design a linear programming framework to find fair utility-maximizing distributions over allocations.
  arXiv  Detail & Related papers  (2023-02-08T00:30:32Z)
• Towards Fair Recommendation in Two-Sided Platforms [36.35034531426411]
  We propose a fair personalized recommendation problem to a constrained version of the problem of fairly allocating indivisible goods. Our proposed em FairRec algorithm guarantees Maxi-Min Share ($alpha$-MMS) of exposure for the producers, and Envy-Free up to One Item (EF1) fairness for the customers.
  arXiv  Detail & Related papers  (2021-12-26T05:14:56Z)
• Balancing Accuracy and Fairness for Interactive Recommendation with Reinforcement Learning [68.25805655688876]
  Fairness in recommendation has attracted increasing attention due to bias and discrimination possibly caused by traditional recommenders. We propose a reinforcement learning based framework, FairRec, to dynamically maintain a long-term balance between accuracy and fairness in IRS. Extensive experiments validate that FairRec can improve fairness, while preserving good recommendation quality.
  arXiv  Detail & Related papers  (2021-06-25T02:02:51Z)
• TFROM: A Two-sided Fairness-Aware Recommendation Model for Both Customers and Providers [10.112208859874618]
  We design a two-sided fairness-aware recommendation model (TFROM) for both customers and providers. Experiments show that TFROM provides better two-sided fairness while still maintaining a higher level of personalization than the baseline algorithms.
  arXiv  Detail & Related papers  (2021-04-19T02:46:54Z)
• DeepFair: Deep Learning for Improving Fairness in Recommender Systems [63.732639864601914]
  The lack of bias management in Recommender Systems leads to minority groups receiving unfair recommendations. We propose a Deep Learning based Collaborative Filtering algorithm that provides recommendations with an optimum balance between fairness and accuracy without knowing demographic information about the users.
  arXiv  Detail & Related papers  (2020-06-09T13:39:38Z)
• Opportunistic Multi-aspect Fairness through Personalized Re-ranking [5.8562079474220665]
  We present a re-ranking approach to fairness-aware recommendation that learns individual preferences across multiple fairness dimensions. We show that our opportunistic and metric-agnostic approach achieves a better trade-off between accuracy and fairness than prior re-ranking approaches.
  arXiv  Detail & Related papers  (2020-05-21T04:25:20Z)
• Exploring User Opinions of Fairness in Recommender Systems [13.749884072907163]
  We ask users what their ideas of fair treatment in recommendation might be. We analyze what might cause discrepancies or changes between user's opinions towards fairness.
  arXiv  Detail & Related papers  (2020-03-13T19:44:26Z)
• FairRec: Two-Sided Fairness for Personalized Recommendations in Two-Sided Platforms [36.35034531426411]
  We investigate the problem of fair recommendation in the context of two-sided online platforms. Our approach involves a novel mapping of the fair recommendation problem to a constrained version of the problem of fairly allocating indivisible goods. Our proposed FairRec algorithm guarantees at least Maximin Share (MMS) of exposure for most of the producers and Envy-Free up to One item (EF1) fairness for every customer.
  arXiv  Detail & Related papers  (2020-02-25T09:43:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.