mlsanityData to 7 Oct 2026

Learning Robust Recommenders through Cross-Model Agreement

arXiv 2105.09605 ↗First posted 20 May 2021cs.IR cs.AIcited by 15

Not on the map. Why?

Abstract (arXiv)

Learning from implicit feedback is one of the most common cases in the application of recommender systems. Generally speaking, interacted examples are considered as positive while negative examples are sampled from uninteracted ones. However, noisy examples are prevalent in real-world implicit feedback. A noisy positive example could be interacted but it actually leads to negative user preference. A noisy negative example which is uninteracted because of unawareness of the user could also denote potential positive user preference. Conventional training methods overlook these noisy examples, leading to sub-optimal recommendations. In this work, we propose a novel framework to learn robust recommenders from implicit feedback. Through an empirical study, we find that different models make relatively similar predictions on clean examples which denote the real user preference, while the predictions on noisy examples vary much more across different models. Motivated by this observation, we propose denoising with cross-model agreement(DeCA) which aims to minimize the KL-divergence between the real user preference distributions parameterized by two recommendation models while maximizing the likelihood of data observation. We employ the proposed DeCA on four state-of-the-art recommendation models and conduct experiments on four datasets. Experimental results demonstrate that DeCA significantly improves recommendation performance compared with normal training and other denoising methods. Codes will be open-sourced.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). Builds on 22 of its 50 references that are in the map. First posted on arXiv 20 May 2021.

Builds on

22 of 50 references.

References · 22

  1. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
  2. 2017Neural Collaborative Filteringcited by 1,108
  3. 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,053
  4. 2016Wide & Deep Learning for Recommender Systemscited by 745
  5. 2019Neural Graph Collaborative Filteringcited by 660
  6. 2017MentorNet: Learning Data-Driven Curriculum for Very Deep Neural Networks on Corrupted Labelscited by 652
  7. 2016Tutorial on Variational Autoencoderscited by 404
  8. 2019KGAT: Knowledge Graph Attention Network for Recommendationcited by 342
  9. 2018Variational Autoencoders for Collaborative Filteringcited by 308
  10. 2020Bias and Debias in Recommender System: A Survey and Future Directionscited by 239
  11. 2017Neural Factorization Machines for Sparse Predictive Analyticscited by 183
  12. 2019SELF: Learning to Filter Noisy Labels with Self-Ensemblingcited by 164
10 more
  1. 2020Neural Collaborative Filtering vs. Matrix Factorization Revisitedcited by 123
  2. 2017Fast Matrix Factorization for Online Recommendation with Implicit Feedbackcited by 100
  3. 2020Denoising Implicit Feedback for Recommendationcited by 80
  4. 2017IRGAN: A Minimax Game for Unifying Generative and Discriminative Information Retrieval Modelscited by 75
  5. 2019RecVAE: a New Variational Autoencoder for Top-N Recommendations with Implicit Feedbackcited by 63
  6. 2020Reinforced Negative Sampling over Knowledge Graph for Recommendationcited by 40
  7. 2019Addressing Marketing Bias in Product Recommendationscited by 23
  8. 2020Sampler Design for Implicit Feedback Data by Noisy-label Robust Learningcited by 18
  9. 2019To Model or to Intervene: A Comparison of Counterfactual and Online Learning to Rank from User Interactionscited by 13
  10. 2018Sampler Design for Bayesian Personalized Ranking by Leveraging View Datacited by 11

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 1; 2024: 6; 2025: 2; 2026: 5.

15 papers.

Sort:

By area: