# Learning Robust Recommenders through Cross-Model Agreement

arXiv: https://arxiv.org/abs/2105.09605 · HTML: https://mlsanity.com/paper/2105.09605/

## Key facts

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

## Builds on (most cited first, 22 of 22)

- [LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation](https://mlsanity.com/paper/2002.02126/) (2020)
- [Neural Collaborative Filtering](https://mlsanity.com/paper/1708.05031/) (2017)
- [Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labels](https://mlsanity.com/paper/1804.06872/) (2018)
- [Wide & Deep Learning for Recommender Systems](https://mlsanity.com/paper/1606.07792/) (2016)
- [Neural Graph Collaborative Filtering](https://mlsanity.com/paper/1905.08108/) (2019)
- [MentorNet: Learning Data-Driven Curriculum for Very Deep Neural Networks on Corrupted Labels](https://mlsanity.com/paper/1712.05055/) (2017)
- [Tutorial on Variational Autoencoders](https://mlsanity.com/paper/1606.05908/) (2016)
- [KGAT: Knowledge Graph Attention Network for Recommendation](https://mlsanity.com/paper/1905.07854/) (2019)
- [Variational Autoencoders for Collaborative Filtering](https://mlsanity.com/paper/1802.05814/) (2018)
- [Bias and Debias in Recommender System: A Survey and Future Directions](https://mlsanity.com/paper/2010.03240/) (2020)
- [Neural Factorization Machines for Sparse Predictive Analytics](https://mlsanity.com/paper/1708.05027/) (2017)
- [SELF: Learning to Filter Noisy Labels with Self-Ensembling](https://mlsanity.com/paper/1910.01842/) (2019)
- [Neural Collaborative Filtering vs. Matrix Factorization Revisited](https://mlsanity.com/paper/2005.09683/) (2020)
- [Fast Matrix Factorization for Online Recommendation with Implicit Feedback](https://mlsanity.com/paper/1708.05024/) (2017)
- [Denoising Implicit Feedback for Recommendation](https://mlsanity.com/paper/2006.04153/) (2020)
- [IRGAN: A Minimax Game for Unifying Generative and Discriminative Information Retrieval Models](https://mlsanity.com/paper/1705.10513/) (2017)
- [RecVAE: a New Variational Autoencoder for Top-N Recommendations with Implicit Feedback](https://mlsanity.com/paper/1912.11160/) (2019)
- [Reinforced Negative Sampling over Knowledge Graph for Recommendation](https://mlsanity.com/paper/2003.05753/) (2020)
- [Addressing Marketing Bias in Product Recommendations](https://mlsanity.com/paper/1912.01799/) (2019)
- [Sampler Design for Implicit Feedback Data by Noisy-label Robust Learning](https://mlsanity.com/paper/2007.07204/) (2020)
- [To Model or to Intervene: A Comparison of Counterfactual and Online Learning to Rank from User Interactions](https://mlsanity.com/paper/1907.06412/) (2019)
- [Sampler Design for Bayesian Personalized Ranking by Leveraging View Data](https://mlsanity.com/paper/1809.08162/) (2018)

## Built on by (most cited first, 15 of 15)

- [Denoising Diffusion Recommender Model](https://mlsanity.com/paper/2401.06982/) (2024)
- [Efficient Bi-Level Optimization for Recommendation Denoising](https://mlsanity.com/paper/2210.10321/) (2022)
- [Double Correction Framework for Denoising Recommendation](https://mlsanity.com/paper/2405.11272/) (2024)
- [LLM4DSR: Leveraging Large Language Model for Denoising Sequential Recommendation](https://mlsanity.com/paper/2408.08208/) (2024)
- [Large Language Model Enhanced Hard Sample Identification for Denoising Recommendation](https://mlsanity.com/paper/2409.10343/) (2024)
- [Diffusion Models in Recommendation Systems: A Survey](https://mlsanity.com/paper/2501.10548/) (2025)
- [Label Denoising through Cross-Model Agreement](https://mlsanity.com/paper/2308.13976/) (2023)
- [When SparseMoE Meets Noisy Interactions: An Ensemble View on Denoising Recommendation](https://mlsanity.com/paper/2409.12730/) (2024)
- [Enhancing Recommendation with Denoising Auxiliary Task](https://mlsanity.com/paper/2409.17402/) (2024)
- [From Entity Reliability to Clean Feedback: An Entity-Aware Denoising Framework Beyond Interaction-Level Signals](https://mlsanity.com/paper/2508.10851/) (2025)
- [TFPS: A Temporal Filtration-enhanced Positive Sample Set Construction Method for Implicit Collaborative Filtering](https://mlsanity.com/paper/2602.22521/) (2026)
- [Joint Behavior-guided and Modality-coherence Conditional Graph Diffusion Denoising for Multi Modal Recommendation](https://mlsanity.com/paper/2604.03654/) (2026)
- [Learning Robust Recommenders from Noisy Implicit Feedback via GMM-Weighted Bayesian Transition Matrix](https://mlsanity.com/paper/2605.20721/) (2026)
- [ANCHOR: Agentic Noise Creation Framework for Human Simulation and Denoising Recommendation](https://mlsanity.com/paper/2606.05621/) (2026)
- [Denoising Implicit Feedback for Cold-start Recommendation](https://mlsanity.com/paper/2606.19658/) (2026)

## 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.
