mlsanityData to 14 Oct 2026

Hard vs. Noise: Resolving Hard-Noisy Sample Confusion in Recommender Systems via Large Language Models

arXiv 2511.07295 ↗First posted 10 Nov 2025cs.IR cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Implicit feedback, employed in training recommender systems, unavoidably confronts noise due to factors such as misclicks and position bias. Previous studies have attempted to identify noisy samples through their diverged data patterns, such as higher loss values, and mitigate their influence through sample dropping or reweighting. However, we observed that noisy samples and hard samples display similar patterns, leading to hard-noisy confusion issue. Such confusion is problematic as hard samples are vital for modeling user preferences. To solve this problem, we propose LLMHNI framework, leveraging two auxiliary user-item relevance signals generated by Large Language Models (LLMs) to differentiate hard and noisy samples. LLMHNI obtains user-item semantic relevance from LLM-encoded embeddings, which is used in negative sampling to select hard negatives while filtering out noisy false negatives. An objective alignment strategy is proposed to project LLM-encoded embeddings, originally for general language tasks, into a representation space optimized for user-item relevance modeling. LLMHNI also exploits LLM-inferred logical relevance within user-item interactions to identify hard and noisy samples. These LLM-inferred interactions are integrated into the interaction graph and guide denoising with cross-graph contrastive alignment. To eliminate the impact of unreliable interactions induced by LLM hallucination, we propose a graph contrastive learning strategy that aligns representations from randomly edge-dropped views to suppress unreliable edges. Empirical results demonstrate that LLMHNI significantly improves denoising and recommendation performance.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 18 of its 23 references that are in the map. First posted on arXiv 10 Nov 2025.

Builds on

18 of 23 references.

References · 18

  1. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,139
  2. 2019Neural Graph Collaborative Filteringcited by 661
  3. 2023A Survey on Large Language Models for Recommendationcited by 379
  4. 2020Self-supervised Graph Learning for Recommendationcited by 305
  5. 2023Adapting Large Language Models by Integrating Collaborative Semantics for Recommendationcited by 179
  6. 2021Are Graph Augmentations Necessary? Simple Graph Contrastive Learning for Recommendationcited by 173
  7. 2023LLMRec: Large Language Models with Graph Augmentation for Recommendationcited by 172
  8. 2023Representation Learning with Large Language Models for Recommendationcited by 155
  9. 2022XSimGCL: Towards Extremely Simple Graph Contrastive Learning for Recommendationcited by 57
  10. 2020Clicks can be Cheating: Counterfactual Recommendation for Mitigating Clickbait Issuecited by 48
  11. 2024Harnessing Large Language Models for Text-Rich Sequential Recommendationcited by 38
  12. 2020Simplify and Robustify Negative Sampling for Implicit Collaborative Filteringcited by 34
6 more
  1. 2022Self-Guided Learning to Denoise for Robust Recommendationcited by 24
  2. 2023AutoDenoise: Automatic Data Instance Denoising for Recommendationscited by 23
  3. 2022Efficient Bi-Level Optimization for Recommendation Denoisingcited by 20
  4. 2024Double Correction Framework for Denoising Recommendationcited by 19
  5. 2023On the Theories Behind Hard Negative Sampling for Recommendationcited by 18
  6. 2021Spatial Object Recommendation with Hints: When Spatial Granularity Matterscited by 11

Built on by

Not cited yet.