Pith. sign in

REVIEW 1 cited by

Large Language Model Enhanced Hard Sample Identification for Denoising Recommendation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2409.10343 v1 pith:BEU7YL2Q submitted 2024-09-16 cs.IR cs.AI

classification cs.IRcs.AI
keywords sampleshardsampledenoisingnoisepreferenceusereffectiveness
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Prediction Is Not Memory: Dual-Timescale Gated Profile Writing for Persistent User Modeling

    cs.IR 2026-07 conditional novelty 6.0 of 10

    A lightweight write-risk gate reduces harmful persistent-profile updates from 22.45% to about 14.5% on MicroLens-100K, and next-item ranking confidence is a poor substitute for write-risk scoring.

Pith tools