mlsanityData to 14 Oct 2026

Reconsidering Learning Objectives in Unbiased Recommendation with Unobserved Confounders

arXiv 2206.03851 ↗First posted 7 Jun 2022cs.IR cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 27 of its 62 references that are in the map. First posted on arXiv 7 Jun 2022.

Builds on

27 of 62 references.

References · 27

  1. 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,917
  2. 2019MixMatch: A Holistic Approach to Semi-Supervised Learningcited by 1,391
  3. 2017Neural Collaborative Filteringcited by 1,111
  4. 2016f-GAN: Training Generative Neural Samplers using Variational Divergence Minimizationcited by 506
  5. 2016Learning from Simulated and Unsupervised Images through Adversarial Trainingcited by 288
  6. 2016Recommendations as Treatments: Debiasing Learning and Evaluationcited by 248
  7. 2020Theoretical Analysis of Self-Training with Deep Networks on Unlabeled Datacited by 180
  8. 2019Support and Invertibility in Domain-Invariant Representationscited by 87
  9. 2019Doubly robust off-policy evaluation with shrinkagecited by 87
  10. 2017Causal Embeddings for Recommendationcited by 79
  11. 2019Unbiased Recommender Learning from Missing-Not-At-Random Implicit Feedbackcited by 79
  12. 2020Maximum Density Divergence for Domain Adaptationcited by 76
15 more
  1. 2017IRGAN: A Minimax Game for Unifying Generative and Discriminative Information Retrieval Modelscited by 75
  2. 2020Self-training Avoids Using Spurious Features Under Domain Shiftcited by 69
  3. 2021AutoDebias: Learning to Debias for Recommendationcited by 68
  4. 2020Off-policy Bandits with Deficient Supportcited by 61
  5. 2018Adversarial Personalized Ranking for Recommendationcited by 49
  6. 2020FairRec: Fairness-aware News Recommendation with Decomposed Adversarial Learningcited by 44
  7. 2019DARec: Deep Domain Adaptation for Cross-Domain Recommendation via Transferring Rating Patternscited by 33
  8. 2020ESAM: Discriminative Domain Adaptation with Non-Displayed Items to Improve Long-Tail Performancecited by 30
  9. 2020Information Theoretic Counterfactual Learning from Missing-Not-At-Random Feedbackcited by 30
  10. 2019Asymmetric Tri-training for Debiasing Missing-Not-At-Random Explicit Feedbackcited by 28
  11. 2021Enhanced Doubly Robust Learning for Debiasing Post-click Conversion Rate Estimationcited by 28
  12. 2021Correcting Exposure Bias for Link Recommendationcited by 17
  13. 2020Adversarial Counterfactual Learning and Evaluation for Recommender Systemcited by 16
  14. 2021Rethinking Neural vs. Matrix-Factorization Collaborative Filtering: the Theoretical Perspectivescited by 8
  15. 2022Cross Pairwise Ranking for Unbiased Item Recommendationcited by 8

Built on by

Not cited yet.