Shintaro Nakamura

2 accepted papers

2024

Fixed-Budget Real-Valued Combinatorial Pure Exploration of Multi-Armed Bandit

AISTATS 2024poster

We study the real-valued combinatorial pure exploration of the multi-armed bandit in the fixed-budget setting. We first introduce an algorithm named the Combinatorial Successive Asign (CSA) algorithm, which is the first algorithm that can identify the best action even when the size of the action cla…

Cited by 1 Source ↗PDF ↗Scholar ↗

2024

Thompson Sampling for Real-Valued Combinatorial Pure Exploration of Multi-Armed Bandit

Shintaro Nakamura, Masashi Sugiyama

AAAI 2024technical

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 arm follows an unknown distribution. In each time step, a player pulls a single arm and observes its reward. The player's goa…

Cited by 7 Source ↗PDF ↗Scholar ↗