Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2206.06810
Cited By
Adversarially Robust Multi-Armed Bandit Algorithm with Variance-Dependent Regret Bounds
14 June 2022
Shinji Ito
Taira Tsuchiya
Junya Honda
AAML
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Adversarially Robust Multi-Armed Bandit Algorithm with Variance-Dependent Regret Bounds"
11 / 11 papers shown
Title
Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worlds
Shinji Ito
Taira Tsuchiya
Junya Honda
46
3
0
01 Mar 2024
Exploration by Optimization with Hybrid Regularizers: Logarithmic Regret with Adversarial Robustness in Partial Monitoring
Taira Tsuchiya
Shinji Ito
Junya Honda
21
1
0
13 Feb 2024
Adaptive Experimental Design for Policy Learning
Masahiro Kato
Kyohei Okumura
Takuya Ishihara
Toru Kitagawa
OffRL
44
0
0
08 Jan 2024
Stability-penalty-adaptive follow-the-regularized-leader: Sparsity, game-dependency, and best-of-both-worlds
Taira Tsuchiya
Shinji Ito
Junya Honda
27
7
0
26 May 2023
Best-of-Three-Worlds Linear Bandit Algorithm with Variance-Adaptive Regret Bounds
Shinji Ito
Kei Takemura
31
8
0
24 Feb 2023
A Blackbox Approach to Best of Both Worlds in Bandits and Beyond
Christoph Dann
Chen-Yu Wei
Julian Zimmert
24
22
0
20 Feb 2023
Asymptotically Optimal Fixed-Budget Best Arm Identification with Variance-Dependent Bounds
Masahiro Kato
Masaaki Imaizumi
Takuya Ishihara
T. Kitagawa
53
2
0
06 Feb 2023
Best-of-Both-Worlds Algorithms for Partial Monitoring
Taira Tsuchiya
Shinji Ito
Junya Honda
13
16
0
29 Jul 2022
Nearly Optimal Best-of-Both-Worlds Algorithms for Online Learning with Feedback Graphs
Shinji Ito
Taira Tsuchiya
Junya Honda
24
24
0
02 Jun 2022
A Robust Phased Elimination Algorithm for Corruption-Tolerant Gaussian Process Bandits
Ilija Bogunovic
Zihan Li
Andreas Krause
Jonathan Scarlett
17
7
0
03 Feb 2022
On Optimal Robustness to Adversarial Corruption in Online Decision Problems
Shinji Ito
42
22
0
22 Sep 2021
1