Denoising Implicit Feedback for Cold-start Recommendation
Not on the map. Why?
Abstract (arXiv)
Implicit feedback is widely used in recommender systems due to its accessibility and generality, yet it usually presents noisy samples (e.g., clickbait, position bias). Meanwhile, recommenders inevitably face the item cold-start problem due to the continuous influx of new items. We identify that cold items are more prone to noisy samples due to the aforementioned factors, and researchers often overlook the significance of denoising implicit feedback for cold items. Previous denoising studies usually identify noisy samples based on heuristic patterns, such as higher loss values, and mitigate noise through sample selection or re-weighting. However, these methods have limited adaptability and are ineffective in cold-start scenarios. To achieve denoising implicit feedback for cold-start recommendation, we propose a model-agnostic denoising method called DIF. First, user preferences for content remain stable, which allows us to infer pseudo-labels indicating whether a user is interested in a cold item through content-similar warm items. Furthermore, to improve pseudo-label accuracy, we model the confidence of pseudo-labels based on the content similarity between the cold item and warm items, and then aggregate multiple pseudo-labels for each sample. Finally, we explicitly estimate the uncertainty of the noisy sample label by considering its relative entropy and the cold-start status of the item, which adaptively guides the role of pseudo-labels to correct the noisy labels at the sample level. DIF's superiority is supported by both theoretical justification and extensive experiments on real-world datasets. The method has been deployed on a billion-user scale short video application Kuaishou and has significantly improved various commercial metrics within cold-start scenarios.
Key facts. No citing papers in the map yet (data through 13 Oct 2026). Builds on 39 of its 56 references that are in the map. First posted on arXiv 17 Jun 2026.
Builds on
39 of 56 references.
References · 39
- 2014Adam: A Method for Stochastic Optimizationcited by 37,093
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,107
- 2017Billion-scale similarity search with GPUscited by 2,490
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,135
- 2017Neural Collaborative Filteringcited by 1,110
- 2017Deep Interest Network for Click-Through Rate Predictioncited by 543
- 2019Unsupervised Label Noise Modeling and Loss Correctioncited by 327
- 2018Joint Optimization Framework for Learning with Noisy Labelscited by 293
- 2020Search-based User Interest Modeling with Lifelong Sequential Behavior Data for Click-Through Rate Predictioncited by 177
- 2021Are Graph Augmentations Necessary? Simple Graph Contrastive Learning for Recommendationcited by 173
- 2020Denoising Implicit Feedback for Recommendationcited by 80
- 2021One Model to Serve All: Star Topology Adaptive Recommender for Multi-Domain CTR Predictioncited by 78
27 more
- 2020Deep k-NN for Noisy Labelscited by 55
- 2023Multi-Modal Self-Supervised Learning for Recommendationcited by 44
- 2020MAMO: Memory-Augmented Meta-Optimization for Cold-start Recommendationcited by 38
- 2020A Model of Two Tales: Dual Transfer Learning Framework for Improved Long-tail Item Recommendationcited by 38
- 2021Learning to Warm Up Cold Item Embeddings for Cold-start Recommendation with Meta Scaling and Shifting Networkscited by 37
- 2024Denoising Diffusion Recommender Modelcited by 28
- 2022Self-Guided Learning to Denoise for Robust Recommendationcited by 24
- 2018Adversarial Sampling and Training for Semi-Supervised Information Retrievalcited by 23
- 2022Real-time Short Video Recommendation on Mobile Devicescited by 21
- 2022Efficient Bi-Level Optimization for Recommendation Denoisingcited by 20
- 2024Large Language Models as Data Augmenters for Cold-Start Item Recommendationcited by 19
- 2024Double Correction Framework for Denoising Recommendationcited by 19
- 2020Sampler Design for Implicit Feedback Data by Noisy-label Robust Learningcited by 18
- 2023Two-Stage Constrained Actor-Critic for Short Video Recommendationcited by 16
- 2021Learning Robust Recommenders through Cross-Model Agreementcited by 15
- 2023Contrastive Collaborative Filtering for Cold-Start Item Recommendationcited by 15
- 2022Empowering Long-tail Item Recommendation through Cross Decoupling Network (CDN)cited by 12
- 2018Sampler Design for Bayesian Personalized Ranking by Leveraging View Datacited by 11
- 2021Exploring Periodicity and Interactivity in Multi-Interest Framework for Sequential Recommendationcited by 8
- 2025LearnAlign: Data Selection for LLM Reinforcement Learning with Improved Gradient Alignmentcited by 8
- 2023Fresh Content Needs More Attention: Multi-funnel Fresh Content Recommendationcited by 7
- 2023Divide and Conquer: Towards Better Embedding-based Retrieval for Recommender Systems From a Multi-task Perspectivecited by 5
- 2022What is Next when Sequential Prediction Meets Implicitly Hard Interaction?cited by 4
- 2022GIFT: Graph-guIded Feature Transfer for Cold-Start Video Click-Through Rate Predictioncited by 4
- 2023Cold-start Bundle Recommendation via Popularity-based Coalescence and Curriculum Heatingcited by 4
- 2016On the Resistance of Nearest Neighbor to Random Noisy Labelscited by 2
- 2024Prompt Tuning for Item Cold-start Recommendationcited by 1
Built on by
Not cited yet.