Reconsidering Learning Objectives in Unbiased Recommendation with Unobserved Confounders
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
SGCL: Unifying Self-Supervised and Supervised Learning for Graph Recommendation
Generative Representational Learning of Foundation Models for Recommendation
Macro Graph of Experts for Billion-Scale Multi-Task Recommendation
Graph Neural Networks in Modern AI-aided Drug Discovery
A Unified Framework against Topology and Class Imbalance
Revisiting Graph based Social Recommendation: A Distillation Enhanced Social Graph Network
토론
이 논문과 연결된 포럼 글이 아직 없습니다.