Automated Data Denoising for Recommendation
Not on the map. Why?
Abstract (arXiv)
In real-world scenarios, most platforms collect both large-scale, naturally noisy implicit feedback and small-scale yet highly relevant explicit feedback. Due to the issue of data sparsity, implicit feedback is often the default choice for training recommender systems (RS), however, such data could be very noisy due to the randomness and diversity of user behaviors. For instance, a large portion of clicks may not reflect true user preferences and many purchases may result in negative reviews or returns. Fortunately, by utilizing the strengths of both types of feedback to compensate for the weaknesses of the other, we can mitigate the above issue at almost no cost. In this work, we propose an Automated Data Denoising framework, textbftextitAutoDenoise, for recommendation, which uses a small number of explicit data as validation set to guide the recommender training. Inspired by the generalized definition of curriculum learning (CL), AutoDenoise learns to automatically and dynamically assign the most appropriate (discrete or continuous) weights to each implicit data sample along the training process under the guidance of the validation performance. Specifically, we use a delicately designed controller network to generate the weights, combine the weights with the loss of each input data to train the recommender system, and optimize the controller with reinforcement learning to maximize the expected accuracy of the trained RS on the noise-free validation set. Thorough experiments indicate that AutoDenoise is able to boost the performance of the state-of-the-art recommendation algorithms on several public benchmark datasets.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 11 May 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 2; 2024: 3; 2025: 0; 2026: 1.
6 papers.
- 2023Data Optimization in Deep Learning: A Surveycited by 6
- 2023BSL: Understanding and Improving Softmax Loss for Recommendationcited by 5
- 2024CAdam: Confidence-Based Optimization for Online Learningcited by 1
- 2024Measuring the Predictability of Recommender Systems using Structural Complexity Metricscited by 0
- 2024When SparseMoE Meets Noisy Interactions: An Ensemble View on Denoising Recommendationcited by 0
- 2026Learning Robust Recommenders from Noisy Implicit Feedback via GMM-Weighted Bayesian Transition Matrixcited by 0
- 2026Learning Robust Recommenders from Noisy Implicit Feedback via GMM-Weighted Bayesian Transition Matrix20 May 2026
- 2024CAdam: Confidence-Based Optimization for Online Learning29 Nov 2024
- 2024When SparseMoE Meets Noisy Interactions: An Ensemble View on Denoising Recommendation19 Sep 2024
- 2024Measuring the Predictability of Recommender Systems using Structural Complexity Metrics12 Apr 2024
- 2023BSL: Understanding and Improving Softmax Loss for Recommendation20 Dec 2023
- 2023Data Optimization in Deep Learning: A Survey25 Oct 2023