Unbiased Learning for the Causal Effect of Recommendation
- URL: http://arxiv.org/abs/2008.04563v3
- Date: Wed, 23 Sep 2020 11:15:39 GMT
- Title: Unbiased Learning for the Causal Effect of Recommendation
- Authors: Masahiro Sato, Sho Takemori, Janmajay Singh, Tomoko Ohkuma
- Abstract summary: This paper proposes an unbiased learning framework for the causal effect of recommendation.
We develop an unbiased learning method for the causal effect extension of a ranking metric.
- Score: 8.849159720632612
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Increasing users' positive interactions, such as purchases or clicks, is an
important objective of recommender systems. Recommenders typically aim to
select items that users will interact with. If the recommended items are
purchased, an increase in sales is expected. However, the items could have been
purchased even without recommendation. Thus, we want to recommend items that
results in purchases caused by recommendation. This can be formulated as a
ranking problem in terms of the causal effect. Despite its importance, this
problem has not been well explored in the related research. It is challenging
because the ground truth of causal effect is unobservable, and estimating the
causal effect is prone to the bias arising from currently deployed
recommenders. This paper proposes an unbiased learning framework for the causal
effect of recommendation. Based on the inverse propensity scoring technique,
the proposed framework first constructs unbiased estimators for ranking
metrics. Then, it conducts empirical risk minimization on the estimators with
propensity capping, which reduces variance under finite training samples. Based
on the framework, we develop an unbiased learning method for the causal effect
extension of a ranking metric. We theoretically analyze the unbiasedness of the
proposed method and empirically demonstrate that the proposed method
outperforms other biased learning methods in various settings.
Related papers
- Improved Estimation of Ranks for Learning Item Recommenders with Negative Sampling [4.316676800486521]
In recommendation systems, there has been a growth in the number of recommendable items.
To lower this cost, it has become common to sample negative items.
In this work, we demonstrate the benefits from correcting the bias introduced by sampling of negatives.
arXiv Detail & Related papers (2024-10-08T21:09:55Z) - Causal Distillation for Alleviating Performance Heterogeneity in Recommender Systems [142.3424649008479]
We show the uneven distribution of historical interactions and the biased training of recommender models.
The key to debiased training lies in eliminating the effect of confounders that influence both the user's historical behaviors and the next behavior.
We propose a causal multi-teacher distillation framework (CausalD) to address unobserved confounders.
arXiv Detail & Related papers (2024-05-31T05:31:00Z) - A First Look at Selection Bias in Preference Elicitation for Recommendation [64.44255178199846]
We study the effect of selection bias in preference elicitation on the resulting recommendations.
A big hurdle is the lack of any publicly available dataset that has preference elicitation interactions.
We propose a simulation of a topic-based preference elicitation process.
arXiv Detail & Related papers (2024-05-01T14:56:56Z) - Going Beyond Popularity and Positivity Bias: Correcting for Multifactorial Bias in Recommender Systems [74.47680026838128]
Two typical forms of bias in user interaction data with recommender systems (RSs) are popularity bias and positivity bias.
We consider multifactorial selection bias affected by both item and rating value factors.
We propose smoothing and alternating gradient descent techniques to reduce variance and improve the robustness of its optimization.
arXiv Detail & Related papers (2024-04-29T12:18:21Z) - Rethinking Missing Data: Aleatoric Uncertainty-Aware Recommendation [59.500347564280204]
We propose a new Aleatoric Uncertainty-aware Recommendation (AUR) framework.
AUR consists of a new uncertainty estimator along with a normal recommender model.
As the chance of mislabeling reflects the potential of a pair, AUR makes recommendations according to the uncertainty.
arXiv Detail & Related papers (2022-09-22T04:32:51Z) - Bilateral Self-unbiased Learning from Biased Implicit Feedback [10.690479112143658]
We propose a novel unbiased recommender learning model, namely BIlateral SElf-unbiased Recommender (BISER)
BISER consists of two key components: (i) self-inverse propensity weighting (SIPW) to gradually mitigate the bias of items without incurring high computational costs; and (ii) bilateral unbiased learning (BU) to bridge the gap between two complementary models in model predictions.
Extensive experiments show that BISER consistently outperforms state-of-the-art unbiased recommender models over several datasets.
arXiv Detail & Related papers (2022-07-26T05:17:42Z) - Cross Pairwise Ranking for Unbiased Item Recommendation [57.71258289870123]
We develop a new learning paradigm named Cross Pairwise Ranking (CPR)
CPR achieves unbiased recommendation without knowing the exposure mechanism.
We prove in theory that this way offsets the influence of user/item propensity on the learning.
arXiv Detail & Related papers (2022-04-26T09:20:27Z) - 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) - Online Evaluation Methods for the Causal Effect of Recommendations [0.20305676256390934]
We propose the first interleaving methods that can efficiently compare recommendation models in terms of causal effects.
We measure the outcomes of both items on an interleaved list and items not on the interleaved list, since the causal effect is the difference between outcomes with and without recommendations.
We then verify the unbiasedness and efficiency of online evaluation methods through simulated online experiments.
arXiv Detail & Related papers (2021-07-14T12:12:59Z) - Causality-Aware Neighborhood Methods for Recommender Systems [3.0919302844782717]
Business objectives of recommenders, such as increasing sales, are aligned with the causal effect of recommendations.
Previous recommenders employ the inverse propensity scoring (IPS) in causal inference.
We develop robust ranking methods for the causal effect of recommendations.
arXiv Detail & Related papers (2020-12-17T08:23:17Z)
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.