Reconsidering Learning Objectives in Unbiased Recommendation: A Distribution Shift Perspective

被引:3
|
作者
Xiao, Teng [1 ]
Chen, Zhengyu [2 ]
Wang, Suhang [1 ]
机构
[1] Penn State Univ, University Pk, PA 16802 USA
[2] Zhejiang Univ, Hangzhou, Peoples R China
基金
美国国家科学基金会;
关键词
Causal Inference; Unbiased Recommendation;
D O I
10.1145/3580305.3599487
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This work studies the problem of learning unbiased algorithms from biased feedback for recommendation. We address this problem from a novel distribution shift perspective. Recent works in unbiased recommendation have advanced the state-of-the-art with various techniques such as re-weighting, multi-task learning, and meta-learning. Despite their empirical successes, most of them lack theoretical guarantees, forming non-negligible gaps between theories and recent algorithms. In this paper, we propose a theoretical understanding of why existing unbiased learning objectives work for unbiased recommendation. We establish a close connection between unbiased recommendation and distribution shift, which shows that existing unbiased learning objectives implicitly align biased training and unbiased test distributions. Built upon this connection, we develop two generalization bounds for existing unbiased learning methods and analyze their learning behavior. Besides, as a result of the distribution shift, we further propose a principled framework, Adversarial Self-Training (AST), for unbiased recommendation. Extensive experiments on real-world and semi-synthetic datasets demonstrate the effectiveness of AST.
引用
收藏
页码:2764 / 2775
页数:12
相关论文
共 50 条
  • [1] Invariant representation learning to popularity distribution shift for recommendation
    He, Ming
    Zhang, Han
    Zhang, Zihao
    Liu, Chang
    WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS, 2024, 27 (02):
  • [2] Invariant representation learning to popularity distribution shift for recommendation
    Ming He
    Han Zhang
    Zihao Zhang
    Chang Liu
    World Wide Web, 2024, 27
  • [3] Unbiased Learning for the Causal Effect of Recommendation
    Sato, Masahiro
    Takemori, Sho
    Singh, Janmajay
    Ohkuma, Tomoko
    RECSYS 2020: 14TH ACM CONFERENCE ON RECOMMENDER SYSTEMS, 2020, : 378 - 387
  • [4] Unbiased Learning to Rank in Feeds Recommendation
    Wu, Xinwei
    Chen, Hechang
    Zhao, Jiashu
    He, Li
    Yin, Dawei
    Chang, Yi
    WSDM '21: PROCEEDINGS OF THE 14TH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING, 2021, : 490 - 498
  • [5] Unbiased Recommendation Through Invariant Representation Learning
    Tang, Min
    Zou, Lixin
    Cui, Shujie
    Liang, Shiuan-ni
    Jin, Zhe
    MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES-APPLIED DATA SCIENCE TRACK, PT X, ECML PKDD 2024, 2024, 14950 : 280 - 296
  • [6] Discriminative-Invariant Representation Learning for Unbiased Recommendation
    Pan, Hang
    Chen, Jiawei
    Feng, Fuli
    Shi, Wentao
    Wu, Junkang
    He, Xiangnan
    PROCEEDINGS OF THE THIRTY-SECOND INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2023, 2023, : 2270 - 2278
  • [7] Transfer learning for collaborative recommendation with biased and unbiased data
    Lin, Zinan
    Liu, Dugang
    Pan, Weike
    Yang, Qiang
    Ming, Zhong
    ARTIFICIAL INTELLIGENCE, 2023, 324
  • [8] A Deep Generative Recommendation Method for Unbiased Learning from Implicit Feedback
    Gupta, Shashank
    Oosterhuis, Harrie
    de Rijke, Maarten
    PROCEEDINGS OF THE 2023 ACM SIGIR INTERNATIONAL CONFERENCE ON THE THEORY OF INFORMATION RETRIEVAL, ICTIR 2023, 2023, : 87 - 93
  • [9] Unbiased Implicit Recommendation and Propensity Estimation via Combinational Joint Learning
    Zhu, Ziwei
    He, Yun
    Zhang, Yin
    Caverlee, James
    RECSYS 2020: 14TH ACM CONFERENCE ON RECOMMENDER SYSTEMS, 2020, : 551 - 556
  • [10] CrossGCL: Cross-pairwise graph contrastive learning for unbiased recommendation
    Ye, Jinxian
    Xu, Ke
    KNOWLEDGE-BASED SYSTEMS, 2024, 296