mlsanityData to 7 Oct 2026

Denoising Implicit Feedback for Recommendation

arXiv 2006.04153 ↗First posted 7 Jun 2020cs.IRcited by 80

Not on the map. Why?

Abstract (arXiv)

The ubiquity of implicit feedback makes them the default choice to build online recommender systems. While the large volume of implicit feedback alleviates the data sparsity issue, the downside is that they are not as clean in reflecting 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 critical importance to account for the inevitable noises in implicit feedback for recommender training. 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 training. We find serious negative impacts of noisy implicit feedback,i.e., fitting the noisy data prevents the recommender from learning the actual user preference. Our target is to identify and prune noisy interactions, so as to improve the quality of recommender training. 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 namedAdaptive Denoising Training(ADT), which adaptively prunes noisy interactions during training. Specifically, we devise two paradigms for adaptive loss formulation: Truncated Loss that discards the large-loss samples with a dynamic threshold in each iteration; and reweighted Loss that adaptively lowers the weight of large-loss samples. We instantiate the two paradigms on the widely used binary cross-entropy loss and test the proposed ADT strategies on three representative recommenders. Extensive experiments on three benchmarks demonstrate that ADT significantly improves the quality of recommendation over normal training.

Key facts. Cited by 80 papers in the map (data through 7 Oct 2026). First posted on arXiv 7 Jun 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 7; 2022: 10; 2023: 10; 2024: 21; 2025: 18; 2026: 14.

80 papers.

Sort:

By area:

  1. 2023Representation Learning with Large Language Models for Recommendationcited by 155
  2. 2021Advances and Challenges in Conversational Recommender Systems: A Surveycited by 118
  3. 2021Contrastive Self-supervised Sequential Recommendation with Robust Augmentationcited by 56
  4. 2024RIME: Robust Preference-based Reinforcement Learning with Noisy Preferencescited by 37
  5. 2024Denoising Diffusion Recommender Modelcited by 28
  6. 2022Efficient Bi-Level Optimization for Recommendation Denoisingcited by 20
  7. 2024A Survey on Diffusion Models for Recommender Systemscited by 20
  8. 2024Double Correction Framework for Denoising Recommendationcited by 19
  9. 2021Learning Robust Recommenders through Cross-Model Agreementcited by 15
  10. 2022Rethinking Collaborative Metric Learning: Toward an Efficient Alternative without Negative Samplingcited by 14
  11. 2023Dual Intent Enhanced Graph Neural Network for Session-based New Item Recommendationcited by 14
  12. 2025Multi-Modal Multi-Behavior Sequential Recommendation with Conditional Diffusion-Based Feature Denoisingcited by 13
38 more
  1. 2021Which Samples Should be Learned First: Easy or Hard?cited by 12
  2. 2021Generating Usage-related Questions for Preference Elicitation in Conversational Recommender Systemscited by 10
  3. 2024Neighborhood-Enhanced Supervised Contrastive Learning for Collaborative Filteringcited by 10
  4. 2024LLM4DSR: Leveraging Large Language Model for Denoising Sequential Recommendationcited by 10
  5. 2022The Minority Matters: A Diversity-Promoting Collaborative Metric Learning Algorithmcited by 9
  6. 2023Understanding Difficulty-based Sample Weighting with a Universal Difficulty Measurecited by 9
  7. 2024Lower-Left Partial AUC: An Effective and Efficient Optimization Metric for Recommendationcited by 9
  8. 2024A Directional Diffusion Graph Transformer for Recommendationcited by 9
  9. 2024Improved Diversity-Promoting Collaborative Metric Learning for Recommendationcited by 9
  10. 2025Hyperbolic Diffusion Recommender Modelcited by 9
  11. 2023LD4MRec: Simplifying and Powering Diffusion Model for Multimedia Recommendationcited by 8
  12. 2024Debiased Recommendation with Noisy Feedbackcited by 8
  13. 2025Flow Matching for Collaborative Filteringcited by 7
  14. 2025Retrieval-Augmented Purifier for Robust LLM-Empowered Recommendationcited by 7
  15. 2025TREND: Tri-teaching for Robust Preference-based Reinforcement Learning with Demonstrationscited by 7
  16. 2023Data Optimization in Deep Learning: A Surveycited by 6
  17. 2024Optimal Estimation of Shared Singular Subspaces across Multiple Noisy Matricescited by 6
  18. 2025Preference VLM: Leveraging VLMs for Scalable Preference-Based Reinforcement Learningcited by 6
  19. 2023BSL: Understanding and Improving Softmax Loss for Recommendationcited by 5
  20. 2022What is Next when Sequential Prediction Meets Implicitly Hard Interaction?cited by 4
  21. 2022Exploring the Learning Difficulty of Data Theory and Measurecited by 4
  22. 2023When Newer is Not Better: Does Deep Learning Really Benefit Recommendation From Implicit Feedback?cited by 4
  23. 2023Integrating Item Relevance in Training Loss for Sequential Recommender Systemscited by 4
  24. 2025LightGNN: Simple Graph Neural Network for Recommendationcited by 4
  25. 2025Diffusion Models in Recommendation Systems: A Surveycited by 3
  26. 2022Denoising Neural Network for News Recommendation with Positive and Negative Implicit Feedbackcited by 2
  27. 2022Adapting Triplet Importance of Implicit Feedback for Personalized Recommendationcited by 2
  28. 2024Algorithmic Fairness: A Tolerance Perspectivecited by 2
  29. 2024Balancing User Preferences by Social Networks: A Condition-Guided Social Recommendation Model for Mitigating Popularity Biascited by 2
  30. 2024Generative Diffusion Models for Sequential Recommendationscited by 2
  31. 2025Similarity as Reward Alignment: Robust and Versatile Preference-based Reinforcement Learningcited by 2
  32. 2025Recommendation Is a Dish Better Served Warmcited by 2
  33. 2026Verifiable Reasoning for LLM-based Generative Recommendationcited by 2
  34. 2021Learning Robust Recommender from Noisy Implicit Feedbackcited by 1
  35. 2023Adversarial Collaborative Filtering for Freecited by 1
  36. 2024CrimeAlarm: Towards Intensive Intent Dynamics in Fine-grained Crime Predictioncited by 1
  37. 2024Better Late Than Never: Formulating and Benchmarking Recommendation Editingcited by 1
  38. 2024Interpretable Triplet Importance for Personalized Rankingcited by 1

50 most cited of 80 All 80 (JSON)