Related papers: Causal Disentanglement with Network Information for Debiased Recommendations

Causal Disentanglement with Network Information for Debiased Recommendations

URL: http://arxiv.org/abs/2204.07221v1
Date: Thu, 14 Apr 2022 20:55:11 GMT
Title: Causal Disentanglement with Network Information for Debiased Recommendations
Authors: Paras Sheth, Ruocheng Guo, Lu Cheng, Huan Liu, K. Sel\c{c}uk Candan
Abstract summary: 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.
Score: 34.698181166037564
License: http://creativecommons.org/licenses/by/4.0/
Abstract: Recommender systems aim to recommend new items to users by learning user and item representations. In practice, these representations are highly entangled as they consist of information about multiple factors, including user's interests, item attributes along with confounding factors such as user conformity, and item popularity. Considering these entangled representations for inferring user preference may lead to biased recommendations (e.g., when the recommender model recommends popular items even if they do not align with the user's interests). Recent research proposes to debias by modeling a recommender system from a causal perspective. The exposure and the ratings are analogous to the treatment and the outcome in the causal inference framework, respectively. The critical challenge in this setting is accounting for the hidden confounders. These confounders are unobserved, making it hard to measure them. On the other hand, since these confounders affect both the exposure and the ratings, it is essential to account for them in generating debiased recommendations. To better approximate hidden confounders, we propose to leverage network information (i.e., user-social and user-item networks), which are shown to influence how users discover and interact with an item. Aside from the user conformity, aspects of confounding such as item popularity present in the network information is also captured in our method with the aid of \textit{causal disentanglement} which unravels the learned representations into independent factors that are responsible for (a) modeling the exposure of an item to the user, (b) predicting the ratings, and (c) controlling the hidden confounders. Experiments on real-world datasets validate the effectiveness of the proposed model for debiasing recommender systems.

Related papers

The MovieLens Beliefs Dataset: Collecting Pre-Choice Data for Online Recommender Systems [0.0]
This paper introduces a method for collecting user beliefs about unexperienced items - a critical predictor of choice behavior. We implement this method on the MovieLens platform, resulting in a rich dataset that combines user ratings, beliefs, and observed recommendations.
arXiv Detail & Related papers (2024-05-17T19:06:06Z)
Rethinking the Evaluation of Dialogue Systems: Effects of User Feedback on Crowdworkers and LLMs [57.16442740983528]
In ad-hoc retrieval, evaluation relies heavily on user actions, including implicit feedback. The role of user feedback in annotators' assessment of turns in a conversational perception has been little studied. We focus on how the evaluation of task-oriented dialogue systems ( TDSs) is affected by considering user feedback, explicit or implicit, as provided through the follow-up utterance of a turn being evaluated.
arXiv Detail & Related papers (2024-04-19T16:45:50Z)
Influential Recommender System [12.765277278599541]
We present Influential Recommender System (IRS), a new recommendation paradigm that aims to proactively lead a user to like a given objective item. IRS progressively recommends to the user a sequence of carefully selected items (called an influence path) We show that IRN significantly outperforms the baseline recommenders and demonstrates its capability of influencing users' interests.
arXiv Detail & Related papers (2022-11-18T03:04:45Z)
Simpson's Paradox in Recommender Fairness: Reconciling differences between per-user and aggregated evaluations [16.053419956606557]
We argue that two notions of fairness in ranking and recommender systems can lead to opposite conclusions. We reconcile these notions and show that the tension is due to differences in distributions of users where items are relevant. Based on this new understanding, practitioners might be interested in either notions, but might face challenges with the per-user metric.
arXiv Detail & Related papers (2022-10-14T12:43:32Z)
Price DOES Matter! Modeling Price and Interest Preferences in Session-based Recommendation [55.0391061198924]
Session-based recommendation aims to predict items that an anonymous user would like to purchase based on her short behavior sequence. It is nontrivial to incorporate price preferences for session-based recommendation. We propose a novel method Co-guided Heterogeneous Hypergraph Network (CoHHN) for session-based recommendation.
arXiv Detail & Related papers (2022-05-09T10:47:15Z)
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)
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)
Deconfounded Causal Collaborative Filtering [56.41625001876272]
Recommender systems may be confounded by various types of confounding factors (also called confounders) We propose Deconfounded Causal Collaborative Filtering (DCCF) to solve the problem. Our method is able to deconfound unobserved confounders to achieve better recommendation performance.
arXiv Detail & Related papers (2021-10-14T02:23:33Z)
Be Causal: De-biasing Social Network Confounding in Recommendation [7.589060156056251]
In recommendation systems, the existence of the missing-not-at-random (MNAR) problem results in the selection bias issue. Most of the existing approaches use models or re-weighting strategy on observed ratings to mimic the missing-at-random setting. We propose an unbiased and robust method called DENC inspired by confounder analysis in causal inference.
arXiv Detail & Related papers (2021-05-17T12:38:59Z)
Seamlessly Unifying Attributes and Items: Conversational Recommendation for Cold-Start Users [111.28351584726092]
We consider the conversational recommendation for cold-start users, where a system can both ask the attributes from and recommend items to a user interactively. Our Conversational Thompson Sampling (ConTS) model holistically solves all questions in conversational recommendation by choosing the arm with the maximal reward to play.
arXiv Detail & Related papers (2020-05-23T08:56:37Z)
Enabling the Analysis of Personality Aspects in Recommender Systems [0.0]
Existing recommender systems mainly focus on exploiting users' feedback, e.g., ratings, and reviews on common items to detect similar users. We call this problem the Data Sparsity With no Feedback on Common Items (DSW-n-FCI) We identify users' personality type implicitly with no burden on users and incorporate it along with users' personal interests and their level of knowledge.
arXiv Detail & Related papers (2020-01-07T23:02:07Z)

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