Shinji Ito
49 papers · 2016–2026 · 8 venues · across top CS/AI venues
This profile combines several different researchers. Authors are keyed by name, and this name's papers fall into 16 separate collaboration groups - the largest holds only 35% of them. Pick the group below that matches the researcher you mean. How a shared name is split.
Achievements are not shown for a combined profile - each one describes a single researcher's record, which this is not.
Which Shinji Ito?
4 groups of papers that share co-authors internally but none with each other - each most likely a different researcher. Pick one to see its papers.
12 papers whose co-authors appear nowhere else under this name
A Tight Lower Bound for Non-stochastic Multi-armed Bandits with Expert Advice
COLT 2026
Data-dependent Bounds with T-Optimal Best-of-Both-Worlds Guarantees in Multi-Armed Bandits using Stability-Penalty Matching
COLT 2025
LC-Tsallis-INF: Generalized Best-of-Both-Worlds Linear Contextual Bandits
AISTATS 2025
On the Minimax Regret for Contextual Linear Bandits and Multi-Armed Bandits with Expert Advice
NeurIPS 2024
Revisiting Online Submodular Minimization: Gap-Dependent Regret Bounds, Best of Both Worlds and Adversarial Robustness
ICML 2022
Single Loop Gaussian Homotopy Method for Non-convex Optimization
NeurIPS 2022
Hybrid Regret Bounds for Combinatorial Semi-Bandits and Adversarial Linear Bandits
NeurIPS 2021
On Optimal Robustness to Adversarial Corruption in Online Decision Problems
NeurIPS 2021
Parameter-Free Multi-Armed Bandit Algorithms with Hybrid Data-Dependent Regret Bounds
COLT 2021
A Tight Lower Bound and Efficient Reduction for Swap Regret
NeurIPS 2020
An Optimal Algorithm for Bandit Convex Optimization with Strongly-Convex and Smooth Loss
AISTATS 2020
Submodular Function Minimization with Noisy Evaluation Oracle
NeurIPS 2019