7 citations · 19 across the 31 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
stat.ML2021★ 2 cited
On Optimal Robustness to Adversarial Corruption in Online Decision Problems
Shinji Ito
This paper considers two fundamental sequential decision-making problems: the problem of prediction with expert advice and the multi-armed bandit problem. We focus on stochastic re…
stat.ML2021
Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions
Kei Takemura, Shinji Ito, Daisuke Hatano +4
The contextual combinatorial semi-bandit problem with linear payoff functions is a decision-making problem in which a learner chooses a set of arms with the feature vectors in each…