paper-with-me

홈 › Papers

Stacked Thompson Bandits

2017-02-28 · Lenz Belzner, Thomas Gabor

We introduce Stacked Thompson Bandits (STB) for efficiently generating plans that are likely to satisfy a given bounded temporal logic requirement. STB uses a simulation for evaluation of plans, and takes a Bayesian approach to using the resulting information to guide its search. In particular, we show that stacking multiarmed bandits and using Thompson sampling to guide the action selection process for each bandit enables STB to generate plans that satisfy requirements with a high probability while only searching a fraction of the search space.

📄 PDF Abstract BibTeX arXiv:1702.08726

Code (1)

jazzbob/stb 공식 구현

Tasks

Thompson Sampling

Similar Papers 제목 키워드 기반

Memory Bounded Open-Loop Planning in Large POMDPs using Thompson Sampling

2019-05-10 · Thomy Phan, Lenz Belzner, Marie Kiermeier, Markus Friedrich 외

State-of-the-art approaches to partially observable planning like POMCP are based on stochastic tree search. While these approaches are computationally efficient, they may still construct search trees of considerable siz…

Thompson Sampling

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

Generalized Thompson Sampling for Contextual Bandits

2013-10-27 · Lihong Li

Thompson Sampling, one of the oldest heuristics for solving multi-armed bandits, has recently been shown to demonstrate state-of-the-art performance. The empirical success has led to great interests in theoretical unders…

Multi-Armed BanditsThompson Sampling

Double Thompson Sampling for Dueling Bandits

2016-04-25 · NeurIPS 2016 12 · Huasen Wu, Xin Liu

In this paper, we propose a Double Thompson Sampling (D-TS) algorithm for dueling bandit problems. As indicated by its name, D-TS selects both the first and the second candidates according to Thompson Sampling. Specifica…

Thompson 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