Large Language Model Enhanced Hard Sample Identification for Denoising Recommendation
Not on the map. Why?
Abstract (arXiv)
Implicit feedback, often used to build recommender systems, unavoidably confronts noise due to factors such as misclicks and position bias. Previous studies have attempted to alleviate this by identifying noisy samples based on their diverged patterns, such as higher loss values, and mitigating the noise through sample dropping or reweighting. Despite the progress, we observe existing approaches struggle to distinguish hard samples and noise samples, as they often exhibit similar patterns, thereby limiting their effectiveness in denoising recommendations. To address this challenge, we propose a Large Language Model Enhanced Hard Sample Denoising (LLMHD) framework. Specifically, we construct an LLM-based scorer to evaluate the semantic consistency of items with the user preference, which is quantified based on summarized historical user interactions. The resulting scores are used to assess the hardness of samples for the pointwise or pairwise training objectives. To ensure efficiency, we introduce a variance-based sample pruning strategy to filter potential hard samples before scoring. Besides, we propose an iterative preference update module designed to continuously refine summarized user preference, which may be biased due to false-positive user-item interactions. Extensive experiments on three real-world datasets and four backbone recommenders demonstrate the effectiveness of our approach.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 16 of its 20 references that are in the map. First posted on arXiv 16 Sep 2024.
Builds on
16 of 20 references.
References · 16
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
- 2019Neural Graph Collaborative Filteringcited by 660
- 2023A Survey on Large Language Models for Recommendationcited by 378
- 2020Self-supervised Graph Learning for Recommendationcited by 305
- 2023LLMRec: Large Language Models with Graph Augmentation for Recommendationcited by 171
- 2023Representation Learning with Large Language Models for Recommendationcited by 155
- 2022Improving Graph Collaborative Filtering with Neighborhood-enriched Contrastive Learningcited by 86
- 2020Clicks can be Cheating: Counterfactual Recommendation for Mitigating Clickbait Issuecited by 48
- 2020Simplify and Robustify Negative Sampling for Implicit Collaborative Filteringcited by 34
- 2022Self-Guided Learning to Denoise for Robust Recommendationcited by 24
- 2023AutoDenoise: Automatic Data Instance Denoising for Recommendationscited by 23
- 2022Efficient Bi-Level Optimization for Recommendation Denoisingcited by 20
4 more
- 2024Double Correction Framework for Denoising Recommendationcited by 19
- 2023On the Theories Behind Hard Negative Sampling for Recommendationcited by 18
- 2021Learning Robust Recommenders through Cross-Model Agreementcited by 15
- 2021Spatial Object Recommendation with Hints: When Spatial Granularity Matterscited by 11
Built on by
Citing papers per year: 2024: 1; 2025: 2.
3 papers.
- 2025A Survey of Foundation Model-Powered Recommender Systems: From Feature-Based, Generative to Agentic Paradigmscited by 17
- 2024Large Language Model Enhanced Recommender Systems: A Surveycited by 10
- 2025VoteGCL: Enhancing Graph-based Recommendations with Majority-Voting LLM-Rerank Augmentationcited by 0
- 2025VoteGCL: Enhancing Graph-based Recommendations with Majority-Voting LLM-Rerank Augmentation29 Jul 2025
- 2025A Survey of Foundation Model-Powered Recommender Systems: From Feature-Based, Generative to Agentic Paradigms23 Apr 2025
- 2024Large Language Model Enhanced Recommender Systems: A Survey18 Dec 2024