Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Exploiting Preferences in Loss Functions for Sequential Recommendation via Weak Transitivity
by
Choi, Hyungwon
, Kim, Jungtaek
, Hyungeun Jo
, Chung, Hyunsoo
in
Design optimization
/ Recommender systems
2024
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Exploiting Preferences in Loss Functions for Sequential Recommendation via Weak Transitivity
by
Choi, Hyungwon
, Kim, Jungtaek
, Hyungeun Jo
, Chung, Hyunsoo
in
Design optimization
/ Recommender systems
2024
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Exploiting Preferences in Loss Functions for Sequential Recommendation via Weak Transitivity
Paper
Exploiting Preferences in Loss Functions for Sequential Recommendation via Weak Transitivity
2024
Request Book From Autostore
and Choose the Collection Method
Overview
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.
Publisher
Cornell University Library, arXiv.org
Subject
This website uses cookies to ensure you get the best experience on our website.