paper-with-me

홈 › Papers

Towards Unified Modeling for Positive and Negative Preferences in Sign-Aware Recommendation

2024-03-13 · YuTing Liu, Yizhou Dang, Yuliang Liang, Qiang Liu, Guibing Guo, Jianzhe Zhao, Xingwei Wang

Recently, sign-aware graph recommendation has drawn much attention as it will learn users' negative preferences besides positive ones from both positive and negative interactions (i.e., links in a graph) with items. To accommodate the different semantics of negative and positive links, existing works utilize two independent encoders to model users' positive and negative preferences, respectively. However, these approaches cannot learn the negative preferences from high-order heterogeneous interactions between users and items formed by multiple links with different signs, resulting in inaccurate and incomplete negative user preferences. To cope with these intractable issues, we propose a novel \textbf{L}ight \textbf{S}igned \textbf{G}raph Convolution Network specifically for \textbf{Rec}ommendation (\textbf{LSGRec}), which adopts a unified modeling approach to simultaneously model high-order users' positive and negative preferences on a signed user-item interaction graph. Specifically, for the negative preferences within high-order heterogeneous interactions, first-order negative preferences are captured by the negative links, while high-order negative preferences are propagated along positive edges. Then, recommendation results are generated based on positive preferences and optimized with negative ones. Finally, we train representations of users and items through different auxiliary tasks. Extensive experiments on three real-world datasets demonstrate that our method outperforms existing baselines regarding performance and computational efficiency. Our code is available at \url{https://anonymous.4open.science/r/LSGRec-BB95}.

📄 PDF Abstract BibTeX arXiv:2403.08246

Code (0)

등록된 구현이 없습니다.

Tasks

Computational Efficiency

Methods 이 논문이 사용한 방법론

Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…

Similar Papers 제목 키워드 기반

Via Negativa for AI Alignment: Why Negative Constraints Are Structurally Superior to Positive Preferences

2026-03-17 · Quan Cheng arxiv

Recent empirical results have demonstrated that training large language models (LLMs) with negative-only feedback can match or exceed standard reinforcement learning from human feedback (RLHF). Negative Sample Reinforcem…

Reinforcement LearningMathematical Reasoning

CoNRec: Context-Discerning Negative Recommendation with LLMs

2026-01-22 · Xinda Chen, Jiawei Wu, Yishuang Liu, Jialin Zhu 외 arxiv

Understanding what users like is relatively straightforward; understanding what users dislike, however, remains a challenging and underexplored problem. Research into users' negative preferences has gained increasing imp…

Recommendation Systems

Positive and Negative Critiquing for VAE-based Recommenders

2022-04-05 · Diego Antognini, Boi Faltings

Providing explanations for recommended items allows users to refine the recommendations by critiquing parts of the explanations. As a result of revisiting critiquing from the perspective of multimodal generative models, …

GPRec: Bi-level User Modeling for Deep Recommenders

2024-10-28 · Yejing Wang, Dong Xu, Xiangyu Zhao, Zhiren Mao 외

GPRec explicitly categorizes users into groups in a learnable manner and aligns them with corresponding group embeddings. We design the dual group embedding space to offer a diverse perspective on group preferences by co…

Learning from Negative User Feedback and Measuring Responsiveness for Sequential Recommenders

2023-08-23 · Yueqi Wang, Yoni Halpern, Shuo Chang, Jingchen Feng 외

Sequential recommenders have been widely used in industry due to their strength in modeling user preferences. While these models excel at learning a user's positive interests, less attention has been paid to learning fro…

counterfactualRecommendation SystemsRetrieval