70 citations · 245 across the 36 of their papers we have counts for
5 papers · 1 filter
Regret Lower Bound and Optimal Algorithm in Finite Stochastic Partial Monitoring
Junpei Komiyama, Junya Honda, Hiroshi Nakagawa
Partial monitoring is a general model for sequential learning with limited feedback formalized as a game between two players. In this game, the learner chooses an action and at the…
Almost Instantaneous Fix-to-Variable Length Codes
Hirosuke Yamamoto, Masato Tsuchihashi, Junya Honda
We propose almost instantaneous fixed-to-variable-length (AIFV) codes such that two (resp. ) code trees are used if code symbols are binary (resp. -ary for ), and…
Regret Lower Bound and Optimal Algorithm in Dueling Bandit Problem
Junpei Komiyama, Junya Honda, Hisashi Kashima +1
We study the -armed dueling bandit problem, a variation of the standard stochastic bandit problem where the feedback is limited to relative comparisons of a pair of arms. We int…
Exact Asymptotics for the Random Coding Error Probability
Junya Honda
Error probabilities of random codes for memoryless channels are considered in this paper. In the area of communication systems, admissible error probability is very small and it is…
Optimal Regret Analysis of Thompson Sampling in Stochastic Multi-armed Bandit Problem with Multiple Plays
Junpei Komiyama, Junya Honda, Hiroshi Nakagawa
We discuss a multiple-play multi-armed bandit (MAB) problem in which several arms are selected at each round. Recently, Thompson sampling (TS), a randomized algorithm with a Bayesi…