A Counterfactual Approach for Addressing Individual User Unfairness in Collaborative Recommender System

• URL: http://arxiv.org/abs/2603.13253v1
• Date: Tue, 24 Feb 2026 15:08:12 GMT
• Title: A Counterfactual Approach for Addressing Individual User Unfairness in Collaborative Recommender System
• Abstract summary: Collaborative filtering (CF) is a widely used variant of RSs which learns hidden patterns from user-item interactions for recommending items to users.<n>Recommendations provided by the traditional CF models are often biased.<n>This paper proposes a dual-step approach which identifies and mitigates individual user unfairness in recommendations.
• Score: 5.575728923132091
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recommender Systems (RSs) are exploited by various business enterprises to suggest their products (items) to consumers (users). Collaborative filtering (CF) is a widely used variant of RSs which learns hidden patterns from user-item interactions for recommending items to users. Recommendations provided by the traditional CF models are often biased. Generally, such models learn and update embeddings for all the users, thereby overlooking the biases toward each under-served users individually. This leads to certain users receiving poorer recommendations than the rest. Such unfair treatment toward users incur loss to the business houses. There is limited research which addressed individual user unfairness problem (IUUP). Existing literature employed explicit exploration-based multi-armed bandits, individual user unfairness metric, and explanation score to address this issue. Although, these works elucidate and identify the underlying individual user unfairness, however, they do not provide solutions for it. In this paper, we propose a dual-step approach which identifies and mitigates IUUP in recommendations. In the proposed work, we counterfactually introduce new interactions to the candidate users (one at a time) and subsequently analyze the benefit from this perturbation. This improves the user engagement with other users and items. Thus, the model can learn effective embeddings across the users. To showcase the effectiveness of the proposed counterfactual methodology, we conducted experiments on MovieLens-100K, Amazon Beauty and MovieLens-1M datasets. The experimental results validate the superiority of the proposed approach over the existing techniques.

Related papers

• MODE: Mutual Optimality in Direct Effects of Reciprocal Recommendations in Matching Markets [0.7310043452300737]
  We formulate the concept of optimality of direct effects'' of the recommendation list for an individual user.<n>We propose a novel method, MODE, that computes mutually optimal recommendations in direct effects.
  arXiv  Detail & Related papers  (2026-08-03T05:54:55Z)
• Tree of Preferences for Diversified Recommendation [54.183647833064136]
  We study diversified recommendation from a data-bias perspective.<n>Inspired by the outstanding performance of large language models (LLMs) in zero-shot inference leveraging world knowledge, we propose a novel approach.
  arXiv  Detail & Related papers  (2025-12-24T04:13:17Z)
• Addressing Personalized Bias for Unbiased Learning to Rank [56.663619153713434]
  Unbiased learning to rank (ULTR) aims to learn unbiased ranking models from biased user behavior logs.<n>We propose a novel user-aware inverse-propensity-score estimator for learning-to-rank objectives.
  arXiv  Detail & Related papers  (2025-08-28T14:01:31Z)
• User-item fairness tradeoffs in recommendations [0.7490658564954134]
  We develop a model of recommendations with user and item fairness objectives.<n>We identify two phenomena: (a) when user preferences are diverse, there is "free" item and user fairness; and (b) users whose preferences are misestimated can be especially disadvantaged by item fairness constraints.
  arXiv  Detail & Related papers  (2024-12-05T18:59:51Z)
• Multi-Cause Deconfounding for Recommender Systems with Latent Confounders [20.559573838679853]
  latent confounding factors can affect user behavior, item exposure, and feedback in distinct ways. Existing methods fail to account for latent confounders between users and their feedback. We propose a multi-cause deconfounding method for recommender systems with latent confounders.
  arXiv  Detail & Related papers  (2024-10-16T08:37:39Z)
• Explainable Active Learning for Preference Elicitation [0.0]
  We employ Active Learning (AL) to solve the addressed problem with the objective of maximizing information acquisition with minimal user effort. AL operates for selecting informative data from a large unlabeled set to inquire an oracle to label them. It harvests user feedback (given for the system's explanations on the presented items) over informative samples to update an underlying machine learning (ML) model.
  arXiv  Detail & Related papers  (2023-09-01T09:22:33Z)
• Debiasing Recommendation by Learning Identifiable Latent Confounders [49.16119112336605]
  Confounding bias arises due to the presence of unmeasured variables that can affect both a user's exposure and feedback. Existing methods either (1) make untenable assumptions about these unmeasured variables or (2) directly infer latent confounders from users' exposure. We propose a novel method, i.e., identifiable deconfounder (iDCF), which leverages a set of proxy variables to resolve the aforementioned non-identification issue.
  arXiv  Detail & Related papers  (2023-02-10T05:10:26Z)
• FedGRec: Federated Graph Recommender System with Lazy Update of Latent Embeddings [108.77460689459247]
  We propose a Federated Graph Recommender System (FedGRec) to mitigate privacy concerns. In our system, users and the server explicitly store latent embeddings for users and items, where the latent embeddings summarize different orders of indirect user-item interactions. We perform extensive empirical evaluations to verify the efficacy of using latent embeddings as a proxy of missing interaction graph.
  arXiv  Detail & Related papers  (2022-10-25T01:08:20Z)
• 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)
• The Unfairness of Active Users and Popularity Bias in Point-of-Interest Recommendation [4.578469978594752]
  This paper studies the interplay between (i) the unfairness of active users, (ii) the unfairness of popular items, and (iii) the accuracy of recommendation as three angles of our study triangle. For item fairness, we divide items into short-head, mid-tail, and long-tail groups and study the exposure of these item groups into the top-k recommendation list of users. Our study shows that most recommendation models cannot satisfy both consumer and producer fairness, indicating a trade-off between these variables possibly due to natural biases in data.
  arXiv  Detail & Related papers  (2022-02-27T08:02:19Z)
• PURS: Personalized Unexpected Recommender System for Improving User Satisfaction [76.98616102965023]
  We describe a novel Personalized Unexpected Recommender System (PURS) model that incorporates unexpectedness into the recommendation process. Extensive offline experiments on three real-world datasets illustrate that the proposed PURS model significantly outperforms the state-of-the-art baseline approaches.
  arXiv  Detail & Related papers  (2021-06-05T01:33:21Z)
• Partial Bandit and Semi-Bandit: Making the Most Out of Scarce Users' Feedback [62.997667081978825]
  We present a novel approach for considering user feedback and evaluate it using three distinct strategies. Despite a limited number of feedbacks returned by users (as low as 20% of the total), our approach obtains similar results to those of state of the art approaches.
  arXiv  Detail & Related papers  (2020-09-16T07:32:51Z)

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.