Robust Recommender System: A Survey and Future Directions
Not on the map. Why?
Abstract (arXiv)
With the rapid growth of information, recommender systems have become integral for providing personalized suggestions and overcoming information overload. However, their practical deployment often encounters ``dirty'' data, where noise or malicious information can lead to abnormal recommendations. Research on improving recommender systems' robustness against such dirty data has thus gained significant attention. This survey provides a comprehensive review of recent work on recommender systems' robustness. We first present a taxonomy to organize current techniques for withstanding malicious attacks and natural noise. We then explore state-of-the-art methods in each category, including fraudster detection, adversarial training, certifiable robust training for defending against malicious attacks, and regularization, purification, self-supervised learning for defending against malicious attacks. Additionally, we summarize evaluation metrics and commonly used datasets for assessing robustness. We discuss robustness across varying recommendation scenarios and its interplay with other properties like accuracy, interpretability, privacy, and fairness. Finally, we delve into open issues and future research directions in this emerging field. Our goal is to provide readers with a comprehensive understanding of robust recommender systems and to identify key pathways for future research and development. To facilitate ongoing exploration, we maintain a continuously updated GitHub repository with related research: https://github.com/Kaike-Zhang/Robust-Recommender-System.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 5 Sep 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 5; 2025: 1; 2026: 1.
7 papers.
- 2026With a Little Help From My Friends: Collective Manipulation in Risk-Controlling Recommender Systemscited by 2
- 2024Distributed Online Life-Long Learning (DOL3) for Multi-agent Trust and Reputation Assessment in E-commercecited by 1
- 2024Goal-Conditioned Supervised Learning for Multi-Objective Recommendationcited by 1
- 2024When SparseMoE Meets Noisy Interactions: An Ensemble View on Denoising Recommendationcited by 0
- 2024DeBaTeR: Denoising Bipartite Temporal Graph for Recommendationcited by 0
- 2024Defending Collaborative Filtering Recommenders via Adversarial Robustness Based Edge Reweightingcited by 0
- 2025MARBLE: Multi-Armed Restless Bandits in Latent Markovian Environmentcited by 0
- 2026With a Little Help From My Friends: Collective Manipulation in Risk-Controlling Recommender Systems30 Mar 2026
- 2025MARBLE: Multi-Armed Restless Bandits in Latent Markovian Environment12 Nov 2025
- 2024Defending Collaborative Filtering Recommenders via Adversarial Robustness Based Edge Reweighting14 Dec 2024
- 2024Goal-Conditioned Supervised Learning for Multi-Objective Recommendation12 Dec 2024
- 2024DeBaTeR: Denoising Bipartite Temporal Graph for Recommendation14 Nov 2024
- 2024Distributed Online Life-Long Learning (DOL3) for Multi-agent Trust and Reputation Assessment in E-commerce21 Oct 2024
- 2024When SparseMoE Meets Noisy Interactions: An Ensemble View on Denoising Recommendation19 Sep 2024