Skip to content
Book Open access

Partial Label Learning-Inspired Denoising Implicit Feedback for Recommendation

Jul 2026 · Annual International ACM SIGIR Conference on Research and Development in Information Retrieval · pp. 3647-3651 · 0 citations · 17 references
Computer Science

TL;DR

This work is the first to reformulate the recommendation denoising problem into a Partial Label Learning (PLL) task, and innovatively leverages PLL paradigms to directly resolve ambiguous implicit feedback, effectively recovering clean signals from noisy candidate sets.

Abstract

Implicit feedback, such as clicks and browsing behaviors, is ubiquitous in recommender systems as a proxy for user preferences. However, these signals are inherently noisy; interactions such as misclicks, unintended views, or unsatisfactory purchases often introduce false positive patterns that mislead model learning. Existing denoising strategies mainly rely on heuristic ''small-loss'' principles to suppress the influence of high-loss samples. However, this approach creates a fundamental trade-off: by indiscriminately penalizing large-value losses, these methods inadvertently weaken the model's ability to learn ''hard'' true positive interactions, thereby compromising robustness and personalization. By conceptualizing this ambiguity as a ''candidate label set'' that encompasses both true and noisy feedback, we are the first to reformulate the recommendation denoising problem into a Partial Label Learning (PLL) task. This novel perspective allows us to address the fundamental challenge of unreliable pseudo-labels by transforming traditional heuristic-based filtering into a principled label disambiguation process. Specifically, we propose PLLD, a Partial Label Learning-inspired Denoising method. Unlike existing methods that rely on indirect signal filtering, PLLD innovatively leverages PLL paradigms to directly resolve ambiguous implicit feedback, effectively recovering clean signals from noisy candidate sets. Experiments on multiple real-world benchmark datasets demonstrate that PLLD consistently improves ranking performance and robustness under substantial noise.

Read PDF

Similar papers

Preprint Aug 2026

Exponential Reward Weighting for Fine-Tuning Generative Recommenders under Sparse and Noisy Feedback

This work proposes Exponential reward-weighted fine-tuning (Exp-RSFT), where each logged interaction is weighted by $\exp(r/\lambda)$, and predicts performance follows an inverted-U trend as a function of $\lambda$, while PPO and DPO often over-optimize unreliable reward models and degrade recommendation quality.

Keertana Chidambaram, Sanath Kumar Krishnamurthy, Qiu-Ling Xu et al. · 0 citations
Conference Jul 2026

A Stacking Ensemble of Collaborative Filtering and Random Forest for Movie Recommendation

Recommender systems often struggle to balance global preference patterns, local similarity, and complex user-item interactions within a single model. Existing approaches combine traditional collaborative filtering (CF) methods such as Singular Value Decomposition (SVD) and K-Nearest Neighbors (KNN) with gradient boosti...

Muhammad Faried Gunawan, Rita Rismala · 0 citations
Book Open access Jul 2026

Mining Informative Interests via Latent Cross Reasoning for Search Enhanced Recommendation

Search and recommendation (S&R) are fundamental components of modern commercial platforms, enabling users to access and explore information efficiently. User behaviors in these scenarios reflect different aspects of user intent, providing an opportunity for joint modeling of S&R. However, effectively leveraging search...

Teng Shi, Weicong Qin, Weijie Yu et al. · 1 citation
Book Open access Jul 2026

Generative Enhanced Modeling: A Collaborative Framework for Enhancing User Representations via Semantic ID

User interest modeling is foundational to recommender systems. However, sparse and noisy behaviors make traditional item-level sequence models brittle, especially for new and low-activity users. Furthermore, relying solely on a user's own history limits exploration and reinforces the ''filter bubbles''. To address this...

Li Li, Wei Xu, Yu Cheng et al. · 0 citations
Preprint Aug 2026

CRAMER: Control via Request-Aware Masking for Editing Recommenders

Control via Request-Aware Masking for Editing Recommenders (CRAMER), a framework that takes users' natural-language requests to immediately change sequential recommendation models' behavior, establishing a new paradigm for request-aware sequential recommendation.

Zhiyuan Su, Naihe Feng, Zhen Qin et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.