Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Alvaro Labarca

dblp:323/4767 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%
Artificial intelligence
1 paper
Reinforcement learning · 77% Representation and self-supervised learning · 23%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
reinforcement learning for recommendation
0.812024
On the Unexpected Effectiveness of Reinforcement Learning for Sequential Recommendation · ICML 2024
Recommender systems
sequential recommendation
0.812024
On the Unexpected Effectiveness of Reinforcement Learning for Sequential Recommendation · ICML 2024
Recommender systems
session-based recommendation
0.812024
On the Unexpected Effectiveness of Reinforcement Learning for Sequential Recommendation · ICML 2024
Machine learning › Representation and self-supervised learning › representation learning
embedding learning
0.212024
On the Unexpected Effectiveness of Reinforcement Learning for Sequential Recommendation · ICML 2024

Methods — techniques the papers use, named apart from their topics

next-item prediction · 1.5auxiliary loss · 1.5
YearPublicationVenuePosition
2024 On the Unexpected Effectiveness of Reinforcement Learning for Sequential Recommendation
abstract
In recent years, Reinforcement Learning (RL) has shown great promise in session-based recommendation. Sequential models that use RL have reached state-of-the-art performance for the Next-item Prediction (NIP) task. This result is intriguing, as the NIP task only evaluates how well the system can correctly recommend the next item to the user, while the goal of RL is to find a policy that optimizes rewards in the long term – sometimes at the expense of suboptimal short-term performance. Then, how can RL improve the system’s performance on short-term metrics? This article investigates this question by exploring proxy learning objectives, which we identify as goals RL models might be following, and thus could explain the performance boost. We found that RL – when used as an auxiliary loss – promotes the learning of embeddings that capture information about the user’s previously interacted items. Subsequently, we replaced the RL objective with a straightforward auxiliary loss designed to predict the number of items the user interacted with. This substitution results in performance gains comparable to RL. These findings pave the way to improve performance and understanding of RL methods for recommender systems.
Alvaro Labarca, Denis Parra, Rodrigo Toro Icarte
ICML1