FaiRIR: Mitigating Exposure Bias from Related Item Recommendations in Two-Sided Platforms

• URL: http://arxiv.org/abs/2204.00241v1
• Date: Fri, 1 Apr 2022 07:01:33 GMT
• Title: FaiRIR: Mitigating Exposure Bias from Related Item Recommendations in Two-Sided Platforms
• Authors: Abhisek Dash, Abhijnan Chakraborty, Saptarshi Ghosh, Animesh Mukherjee, and Krishna P. Gummadi
• Abstract summary: We introduce flexible interventions (FaiRIR) in the Related Item Recommendations pipeline. We show that our mechanisms allow for a fine-grained control on the exposure distribution, often at a small or no cost in terms of relatedness and user satisfaction.
• Score: 17.42360994589386
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Related Item Recommendations (RIRs) are ubiquitous in most online platforms today, including e-commerce and content streaming sites. These recommendations not only help users compare items related to a given item, but also play a major role in bringing traffic to individual items, thus deciding the exposure that different items receive. With a growing number of people depending on such platforms to earn their livelihood, it is important to understand whether different items are receiving their desired exposure. To this end, our experiments on multiple real-world RIR datasets reveal that the existing RIR algorithms often result in very skewed exposure distribution of items, and the quality of items is not a plausible explanation for such skew in exposure. To mitigate this exposure bias, we introduce multiple flexible interventions (FaiRIR) in the RIR pipeline. We instantiate these mechanisms with two well-known algorithms for constructing related item recommendations -- rating-SVD and item2vec -- and show on real-world data that our mechanisms allow for a fine-grained control on the exposure distribution, often at a small or no cost in terms of recommendation quality, measured in terms of relatedness and user satisfaction.

Related papers

• A Thorough Performance Benchmarking on Lightweight Embedding-based Recommender Systems [67.52782366565658]
  State-of-the-art recommender systems (RSs) depend on categorical features, which ecoded by embedding vectors, resulting in excessively large embedding tables. Despite the prosperity of lightweight embedding-based RSs, a wide diversity is seen in evaluation protocols. This study investigates various LERS' performance, efficiency, and cross-task transferability via a thorough benchmarking process.
  arXiv  Detail & Related papers  (2024-06-25T07:45:00Z)
• An IPW-based Unbiased Ranking Metric in Two-sided Markets [3.845857580909374]
  This paper addresses the complex interaction of biases between users in two-sided markets. We propose a new estimator, named two-sided IPW, to address the position bases in two-sided markets.
  arXiv  Detail & Related papers  (2023-07-14T01:44:03Z)
• VFed-SSD: Towards Practical Vertical Federated Advertising [53.08038962443853]
  We propose a semi-supervised split distillation framework VFed-SSD to alleviate the two limitations. Specifically, we develop a self-supervised task MatchedPair Detection (MPD) to exploit the vertically partitioned unlabeled data. Our framework provides an efficient federation-enhanced solution for real-time display advertising with minimal deploying cost and significant performance lift.
  arXiv  Detail & Related papers  (2022-05-31T17:45:30Z)
• FairSR: Fairness-aware Sequential Recommendation through Multi-Task Learning with Preference Graph Embeddings [14.543386085745192]
  Sequential recommendation learns from the temporal dynamics of user-item interactions to predict the next ones. This paper aims at bringing a marriage between SR and algorithmic fairness. We propose a novel fairness-aware sequential recommendation task, in which a new metric, interaction fairness, is defined.
  arXiv  Detail & Related papers  (2022-04-30T17:33:51Z)
• Joint Multisided Exposure Fairness for Recommendation [76.75990595228666]
  This paper formalizes a family of exposure fairness metrics that model the problem jointly from the perspective of both the consumers and producers. Specifically, we consider group attributes for both types of stakeholders to identify and mitigate fairness concerns that go beyond individual users and items towards more systemic biases in recommendation.
  arXiv  Detail & Related papers  (2022-04-29T19:13:23Z)
• Causal Disentanglement with Network Information for Debiased Recommendations [34.698181166037564]
  Recent research proposes to debias by modeling a recommender system from a causal perspective. The critical challenge in this setting is accounting for the hidden confounders. We propose to leverage network information (i.e., user-social and user-item networks) to better approximate hidden confounders.
  arXiv  Detail & Related papers  (2022-04-14T20:55:11Z)
• Masked Transformer for Neighhourhood-aware Click-Through Rate Prediction [74.52904110197004]
  We propose Neighbor-Interaction based CTR prediction, which put this task into a Heterogeneous Information Network (HIN) setting. In order to enhance the representation of the local neighbourhood, we consider four types of topological interaction among the nodes. We conduct comprehensive experiments on two real world datasets and the experimental results show that our proposed method outperforms state-of-the-art CTR models significantly.
  arXiv  Detail & Related papers  (2022-01-25T12:44:23Z)
• Deep Causal Reasoning for Recommendations [47.83224399498504]
  A new trend in recommender system research is to negate the influence of confounders from a causal perspective. We model the recommendation as a multi-cause multi-outcome (MCMO) inference problem. We show that MCMO modeling may lead to high variance due to scarce observations associated with the high-dimensional causal space.
  arXiv  Detail & Related papers  (2022-01-06T15:00:01Z)
• Incentives for Item Duplication under Fair Ranking Policies [69.14168955766847]
  We study the behaviour of different fair ranking policies in the presence of duplicates. We find that fairness-aware ranking policies may conflict with diversity, due to their potential to incentivize duplication more than policies solely focused on relevance.
  arXiv  Detail & Related papers  (2021-10-29T11:11:15Z)
• A Graph-based Approach for Mitigating Multi-sided Exposure Bias in Recommender Systems [7.3129791870997085]
  We introduce FairMatch, a graph-based algorithm that improves exposure fairness for items and suppliers. A comprehensive set of experiments on two datasets and comparison with state-of-the-art baselines show that FairMatch, while significantly improves exposure fairness and aggregate diversity, maintains an acceptable level of relevance of the recommendations.
  arXiv  Detail & Related papers  (2021-07-07T18:01:26Z)

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.