1 citations · 1 across the 4 of their papers we have counts for
4 papers
Multi-Play Combinatorial Semi-Bandit Problem
Shintaro Nakamura, Yuko Kuroki, Wei Chen
In the combinatorial semi-bandit (CSB) problem, a player selects an action from a combinatorial action set and observes feedback from the base arms included in the action. While CS…
Fixed-Budget Real-Valued Combinatorial Pure Exploration of Multi-Armed Bandit
Shintaro Nakamura, Masashi Sugiyama
We study the real-valued combinatorial pure exploration of the multi-armed bandit in the fixed-budget setting. We first introduce the Combinatorial Successive Asign (CSA) algorithm…
Thompson Sampling for Real-Valued Combinatorial Pure Exploration of Multi-Armed Bandit
Shintaro Nakamura, Masashi Sugiyama
We study the real-valued combinatorial pure exploration of the multi-armed bandit (R-CPE-MAB) problem. In R-CPE-MAB, a player is given stochastic arms, and the reward of each a…
A Fast Algorithm for the Real-Valued Combinatorial Pure Exploration of Multi-Armed Bandit
Shintaro Nakamura, Masashi Sugiyama
We study the real-valued combinatorial pure exploration problem in the stochastic multi-armed bandit (R-CPE-MAB). We study the case where the size of the action set is polynomial w…