Freshness-Aware Thompson Sampling
To follow the dynamicity of the user's content, researchers have recently started to model interactions between users and the Context-Aware Recommender Systems (CARS) as a bandit problem where the system needs to deal with exploration and exploitation dilemma. In this sense, we propose to study the freshness of the user's content in CARS through the bandit problem. We introduce in this paper an algorithm named Freshness-Aware Thompson Sampling (FA-TS) that manages the recommendation of fresh document according to the user's risk of the situation. The intensive evaluation and the detailed analysis of the experimental results reveals several important discoveries in the exploration/exploitation (exr/exp) behaviour.
Code (0)
등록된 구현이 없습니다.
Tasks
Recommendation SystemsThompson SamplingSimilar Papers 제목 키워드 기반
Robust Thompson Sampling Algorithms Against Reward Poisoning Attacks
Thompson sampling is one of the most popular learning algorithms for online sequential decision-making problems and has rich real-world applications. However, current Thompson sampling algorithms are limited by the assum…
Decision MakingSequential Decision MakingThompson SamplingState-Aware Variational Thompson Sampling for Deep Q-Networks
Thompson sampling is a well-known approach for balancing exploration and exploitation in reinforcement learning. It requires the posterior distribution of value-action functions to be maintained; this is generally intrac…
Thompson SamplingFreshness-Aware Prioritized Experience Replay for LLM/VLM Reinforcement Learning
Reinforcement Learning (RL) has achieved impressive success in post-training Large Language Models (LLMs) and Vision-Language Models (VLMs), with on-policy algorithms such as PPO, GRPO, and REINFORCE++ serving as the dom…
Reinforcement LearningA Survey of Freshness-Aware Wireless Networking with Reinforcement Learning
The age of information (AoI) has become a central measure of data freshness in modern wireless systems, yet existing surveys either focus on classical AoI formulations or provide broad discussions of reinforcement learni…
Reinforcement LearningTrajectory PlanningVariance-Aware Feel-Good Thompson Sampling for Contextual Bandits
Variance-dependent regret bounds have received increasing attention in recent studies on contextual bandits. However, most of these studies are focused on upper confidence bound (UCB)-based bandit algorithms, while sampl…