Asymmetric Tri-training for Debiasing Missing-Not-At-Random Explicit Feedback
Yuta Saito
Abstract
In most real-world recommender systems, the observed rating data are subject to selection bias, and the data are thus missing-not-at-random. Developing a method to facilitate the learning of a recommender with biased feedback is one of the most challenging problems, as it is widely known that naive approaches under selection bias often lead to suboptimal results. A well-established solution for the problem is using propensity scoring techniques. The propensity score is the probability of each data being observed, and unbiased performance estimation is possible by weighting each data by the inverse of its propensity. However, the performance of the propensity-based unbiased estimation approach is often affected by choice of the propensity estimation model or the high variance problem. To overcome these limitations, we propose a model-agnostic meta-learning method inspired by the asymmetric tri-training framework for unsupervised domain adaptation. The proposed method utilizes two predictors to generate data with reliable pseudo-ratings and another predictor to make the final predictions. In a theoretical analysis, a propensity-independent upper bound of the true performance metric is derived, and it is demonstrated that the proposed method can minimize this bound. We conduct comprehensive experiments using public real-world datasets. The results suggest that the previous propensity-based methods are largely affected by the choice of propensity models and the variance problem caused by the inverse propensity weighting. Moreover, we show that the proposed meta-learning method is robust to these issues and can facilitate in developing effective recommendations from biased explicit feedback.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 749732b3-58ce-4ff0-99c7-2bca514bd209Cited by top-tier papers29
- AutoDebias: Learning to Debias for RecommendationJiawei Chen, Hande Dong, Yang Qiu, Xiangnan He et al.SIGIR 2021 · 167 citations
- Enhanced Doubly Robust Learning for Debiasing Post-Click Conversion Rate EstimationSiyuan Guo, Lixin Zou, Yiding Liu, Wenwen Ye et al.SIGIR 2021 · 63 citations
- Rethinking Cross-Domain Sequential Recommendation under Open-World AssumptionsWujiang Xu, Qitian Wu, Runzhong Wang, Mingming Ha et al.WWW 2024 · 55 citations
- Propensity Matters: Measuring and Enhancing Balancing for RecommendationHaoxuan Li, Yanghao Xiao, Chunyuan Zheng, Peng Wu et al.ICML 2023 · 55 citations
- Mitigating Sentiment Bias for Recommender SystemsChen Lin, Xinyi Liu, Guipeng Xv, Hui LiSIGIR 2021 · 31 citations
Related papers
- Reconsidering Learning Objectives in Unbiased Recommendation: A Distribution Shift PerspectiveTeng Xiao, Zhengyu Chen, Suhang WangKDD 2023 · 8 citations
- Balancing Unobserved Confounding with a Few Unbiased Ratings in Debiased RecommendationsHaoxuan Li, Yanghao Xiao, Chunyuan Zheng, Peng WuWWW 2023 · 64 citations
- Rating Distribution Calibration for Selection Bias Mitigation in RecommendationsHaochen Liu, Da Tang, Ji Yang, Xiangyu Zhao et al.WWW 2022 · 31 citations
- Removing Hidden Confounding in Recommendation: A Unified Multi-Task Learning ApproachHaoxuan Li, Kunhan Wu, Chunyuan Zheng, Yanghao Xiao et al.NeurIPS 2023 · 68 citations
- Cross Pairwise Ranking for Unbiased Item RecommendationQi Wan, Xiangnan He, Xiang Wang, Jiancan Wu et al.WWW 2022 · 46 citations
