10 citations · 15 across the 5 of their papers we have counts for
5 papers
Online Dense Subgraph Discovery via Blurred-Graph Feedback
Yuko Kuroki, Atsushi Miyauchi, Junya Honda +1
Dense subgraph discovery aims to find a dense component in edge-weighted graphs. This is a fundamental graph-mining task with a variety of applications and thus has received much a…
A Note on KL-UCB+ Policy for the Stochastic Bandit
Junya Honda
A classic setting of the stochastic K-armed bandit problem is considered in this note. In this problem it has been known that KL-UCB policy achieves the asymptotically optimal regr…
A Bad Arm Existence Checking Problem
Koji Tabata, Atsuyoshi Nakamura, Junya Honda +1
We study a bad arm existing checking problem in which a player's task is to judge whether a positive arm exists or not among given K arms by drawing as small number of arms as poss…
Variable-to-Fixed Length Homophonic Coding with a Modified Shannon-Fano-Elias Code
Junya Honda, Hirosuke Yamamoto
Homophonic coding is a framework to reversibly convert a message into a sequence with some target distribution. This is a promising tool to generate a codeword with a biased code-s…
Finite-time Regret Bound of a Bandit Algorithm for the Semi-bounded Support Model
Junya Honda, Akimichi Takemura
In this paper we consider stochastic multiarmed bandit problems. Recently a policy, DMED, is proposed and proved to achieve the asymptotic bound for the model that each reward dist…