Learning Robust Recommender from Noisy Implicit Feedback
Not on the map. Why?
Abstract (arXiv)
The ubiquity of implicit feedback makes it indispensable for building recommender systems. However, it does not actually reflect the actual satisfaction of users. For example, in E-commerce, a large portion of clicks do not translate to purchases, and many purchases end up with negative reviews. As such, it is of importance to account for the inevitable noises in implicit feedback. However, little work on recommendation has taken the noisy nature of implicit feedback into consideration. In this work, we explore the central theme of denoising implicit feedback for recommender learning, including training and inference. By observing the process of normal recommender training, we find that noisy feedback typically has large loss values in the early stages. Inspired by this observation, we propose a new training strategy named Adaptive Denoising Training (ADT), which adaptively prunes the noisy interactions by two paradigms (i.e., Truncated Loss and Reweighted Loss). Furthermore, we consider extra feedback (e.g., rating) as auxiliary signal and propose three strategies to incorporate extra feedback into ADT: finetuning, warm-up training, and colliding inference. We instantiate the two paradigms on the widely used binary cross-entropy loss and test them on three representative recommender models. Extensive experiments on three benchmarks demonstrate that ADT significantly improves the quality of recommendation over normal training without using extra feedback. Besides, the proposed three strategies for using extra feedback largely enhance the denoising ability of ADT.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 31 of its 61 references that are in the map. First posted on arXiv 2 Dec 2021.
Builds on
31 of 61 references.
References · 31
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2017Neural Collaborative Filteringcited by 1,108
- 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,053
- 2017A Closer Look at Memorization in Deep Networkscited by 936
- 2019Neural Graph Collaborative Filteringcited by 660
- 2017MentorNet: Learning Data-Driven Curriculum for Very Deep Neural Networks on Corrupted Labelscited by 652
- 2016Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filteringcited by 517
- 2019How does Disagreement Help Generalization against Label Corruption?cited by 390
- 2020Unbiased Scene Graph Generation from Biased Trainingcited by 355
- 2018Variational Autoencoders for Collaborative Filteringcited by 308
- 2020Counterfactual VQA: A Cause-Effect Look at Language Biascited by 266
- 2021Distilling Causal Effect of Data in Class-Incremental Learningcited by 117
19 more
- 2019Managing Popularity Bias in Recommender Systems with Personalized Re-rankingcited by 81
- 2020Denoising Implicit Feedback for Recommendationcited by 80
- 2017Causal Embeddings for Recommendationcited by 79
- 2019Unbiased Recommender Learning from Missing-Not-At-Random Implicit Feedbackcited by 79
- 2017IRGAN: A Minimax Game for Unifying Generative and Discriminative Information Retrieval Modelscited by 75
- 2015Modeling User Exposure in Recommendationcited by 69
- 2020Controlling Fairness and Bias in Dynamic Learning-to-Rankcited by 67
- 2018Unbiased Learning to Rank with Unbiased Propensity Estimationcited by 61
- 2020GCN-Based User Representation Learning for Unifying Robust Recommendation and Fraudster Detectioncited by 53
- 2021Deconfounded Recommendation for Alleviating Bias Amplificationcited by 51
- 2020Clicks can be Cheating: Counterfactual Recommendation for Mitigating Clickbait Issuecited by 48
- 2020Should Graph Convolution Trust Neighbors? A Simple Causal Inference Methodcited by 25
- 2020Review of The Book of Why: The New Science of Cause and Effectcited by 19
- 2020Sampler Design for Implicit Feedback Data by Noisy-label Robust Learningcited by 18
- 2018Learning to Recommend with Multiple Cascading Behaviorscited by 16
- 2019LambdaOpt: Learn to Regularize Recommender Models in Finer Levelscited by 14
- 2019To Model or to Intervene: A Comparison of Counterfactual and Online Learning to Rank from User Interactionscited by 13
- 2021Empowering Language Understanding with Counterfactual Reasoningcited by 13
- 2020Adversarial Attacks and Detection on Reinforcement Learning-Based Interactive Recommender Systemscited by 9
Built on by
Citing papers per year: 2024: 1.
1 paper.
- 2024CAdam: Confidence-Based Optimization for Online Learningcited by 1
- 2024CAdam: Confidence-Based Optimization for Online Learning29 Nov 2024