paper-with-me

Papers

Thompson Sampling in Dynamic Systems for Contextual Bandit Problems

2013-10-17 · Tianbing Xu, Yaming Yu, John Turner, Amelia Regan

We consider the multiarm bandit problems in the timevarying dynamic system for rich structural features. For the nonlinear dynamic model, we propose the approximate inference for the posterior distributions based on Laplace Approximation. For the context bandit problems, Thompson Sampling is adopted based on the underlying posterior distributions of the parameters. More specifically, we introduce the discount decays on the previous samples impact and analyze the different decay rates with the underlying sample dynamics. Consequently, the exploration and exploitation is adaptively tradeoff according to the dynamics in the system.

📄 PDF Abstract BibTeX arXiv:1310.5008

Code (0)

등록된 구현이 없습니다.

Tasks

Thompson Sampling

Similar Papers 제목 키워드 기반

Context Attentive Bandits: Contextual Bandit with Restricted Context

2017-05-10 · Djallel Bouneffouf, Irina Rish, Guillermo A. Cecchi, Raphael Feraud

We consider a novel formulation of the multi-armed bandit model, which we call the contextual bandit with restricted context, where only a limited number of features can be accessed by the learner at every iteration. Thi…

Recommendation SystemsThompson Sampling

Feel-Good Thompson Sampling for Contextual Bandits and Reinforcement Learning

2021-10-02 · Tong Zhang

Thompson Sampling has been widely used for contextual bandit problems due to the flexibility of its modeling power. However, a general theory for this class of methods in the frequentist setting is still lacking. In this…

Multi-Armed Banditsregressionreinforcement-learningReinforcement Learning+2

Thompson Sampling Regret Bounds for Contextual Bandits with sub-Gaussian rewards

2023-04-26 · Amaury Gouverneur, Borja Rodríguez-Gálvez, Tobias J. Oechtering, Mikael Skoglund

In this work, we study the performance of the Thompson Sampling algorithm for Contextual Bandit problems based on the framework introduced by Neu et al. and their concept of lifted information ratio. First, we prove a co…

Multi-Armed BanditsThompson Sampling

Langevin Monte Carlo for Contextual Bandits

2022-06-22 · Pan Xu, Hongkai Zheng, Eric Mazumdar, Kamyar Azizzadenesheli 외

We study the efficiency of Thompson sampling for contextual bandits. Existing Thompson sampling-based algorithms need to construct a Laplace approximation (i.e., a Gaussian distribution) of the posterior distribution, wh…

Multi-Armed BanditsThompson Sampling

Parallel Contextual Bandits in Wireless Handover Optimization

2019-01-21 · Igor Colin, Albert Thomas, Moez Draief

As cellular networks become denser, a scalable and dynamic tuning of wireless base station parameters can only be achieved through automated optimization. Although the contextual bandit framework arises as a natural cand…

Multi-Armed BanditsThompson Sampling