Exploiting Preferences in Loss Functions for Sequential Recommendation via Weak Transitivity

Abstract

A choice of optimization objective is immensely pivotal in the design of a recommender system as it affects the general modeling process of a user's intent from previous interactions. Existing approaches mainly adhere to three categories of loss functions: pairwise, pointwise, and setwise loss functions. Despite their effectiveness, a critical and common drawback of such objectives is viewing the next observed item as a unique positive while considering all remaining items equally negative. Such a binary label assignment is generally limited to assuring a higher recommendation score of the positive item, neglecting potential structures induced by varying preferences between other unobserved items. To alleviate this issue, we propose a novel method that extends original objectives to explicitly leverage the different levels of preferences as relative orders between their scores. Finally, we demonstrate the superior performance of our method compared to baseline objectives.

Accepted to CIKM 2024, Short Research Paper Track

References in corpus (9)

• Neural Graph Collaborative Filtering
• Self-supervised Graph Learning for Recommendation
• S^3-Rec: Self-Supervised Learning for Sequential Recommendation with Mutual Information Maximization
• IRGAN: A Minimax Game for Unifying Generative and Discriminative Information Retrieval Models
• Filter-enhanced MLP is All You Need for Sequential Recommendation
• Heterogeneous Graph Contrastive Learning for Recommendation
• On the Effectiveness of Sampled Softmax Loss for Item Recommendation
• Turning Dross Into Gold Loss: is BERT4Rec really better than SASRec?
• gSASRec: Reducing Overconfidence in Sequential Recommendation Trained with Negative Sampling