P
PaperPicks
Conferences
Shinji Ito
21 papers at tracked venues · 9 at CORE A* · active 2024–2026
DBLP profile ↗
ORCID search ↗
Venues
COLT
×8
NeurIPS
×7
ECML-PKDD
×2
AAAI
×1
AISTATS
×1
ICML
×1
IJCAI
×1
Frequent coauthors
Taira Tsuchiya
DBLP profile ↗
ORCID search ↗
×4
Jongyeong Lee
DBLP profile ↗
ORCID search ↗
×3
Zachary Chase
DBLP profile ↗
ORCID search ↗
×1
Tsubasa Harada
DBLP profile ↗
ORCID search ↗
×1
Quan M. Nguyen
DBLP profile ↗
ORCID search ↗
×1
Masahiro Kato
DBLP profile ↗
ORCID search ↗
×1
Baiyuan Chen
DBLP profile ↗
ORCID search ↗
×1
Achraf Azize
DBLP profile ↗
ORCID search ↗
×1
Kazuma Shimizu
DBLP profile ↗
ORCID search ↗
×1
Koji Ichikawa
DBLP profile ↗
ORCID search ↗
×1
Ken Yokoyama
DBLP profile ↗
ORCID search ↗
×1
Papers
A Tight Lower Bound for Non-stochastic Multi-armed Bandits with Expert Advice
COLT 2026
·
Zachary Chase
DBLP profile ↗
ORCID search ↗
Adaptive Learning Rates with Surrogate Probability for Follow-the-Perturbed-Leader
COLT 2026
·
Jongyeong Lee
DBLP profile ↗
ORCID search ↗
Adversarial Learning in Games with Bandit Feedback: Logarithmic Pure-Strategy Maximin Regret
COLT 2026
·
Shinji Ito
Adapting to Stochastic and Adversarial Losses in Episodic MDPs with Aggregate Bandit Feedback
NeurIPS 2025
·
Shinji Ito
Bandit Max-Min Fair Allocation
ECML-PKDD 2025
·
Tsubasa Harada
DBLP profile ↗
ORCID search ↗
Corrupted Learning Dynamics in Games
COLT 2025
·
Taira Tsuchiya
DBLP profile ↗
ORCID search ↗
Data-dependent Bounds with T-Optimal Best-of-Both-Worlds Guarantees in Multi-Armed Bandits using Stability-Penalty Matching
COLT 2025
·
Quan M. Nguyen
DBLP profile ↗
ORCID search ↗
Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback
COLT 2025
·
Shinji Ito
LC-Tsallis-INF: Generalized Best-of-Both-Worlds Linear Contextual Bandits
AISTATS 2025
·
Masahiro Kato
DBLP profile ↗
ORCID search ↗
Optimal Dynamic Regret by Transformers for Non-Stationary Reinforcement Learning
NeurIPS 2025
·
Baiyuan Chen
DBLP profile ↗
ORCID search ↗
Optimal Regret of Bandits under Differential Privacy
NeurIPS 2025
·
Achraf Azize
DBLP profile ↗
ORCID search ↗
Revisiting Follow-the-Perturbed-Leader with Unbounded Perturbations in Bandit Problems
NeurIPS 2025
·
Jongyeong Lee
DBLP profile ↗
ORCID search ↗
A Simple and Adaptive Learning Rate for FTRL in Online Learning with Minimax Regret of $\Theta(T{2/3})$ and its Application to Best-of-Both-Worlds
NeurIPS 2024
·
Taira Tsuchiya
DBLP profile ↗
ORCID search ↗
Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worlds
COLT 2024
·
Shinji Ito
Exploration by Optimization with Hybrid Regularizers: Logarithmic Regret with Adversarial Robustness in Partial Monitoring
ICML 2024
·
Taira Tsuchiya
DBLP profile ↗
ORCID search ↗
Fast Rates in Stochastic Online Convex Optimization by Exploiting the Curvature of Feasible Sets
NeurIPS 2024
·
Taira Tsuchiya
DBLP profile ↗
ORCID search ↗
Follow-the-Perturbed-Leader with Fréchet-type Tail Distributions: Optimality in Adversarial Bandits and Best-of-Both-Worlds
COLT 2024
·
Jongyeong Lee
DBLP profile ↗
ORCID search ↗
Learning with Posterior Sampling for Revenue Management under Time-varying Demand
IJCAI 2024
·
Kazuma Shimizu
DBLP profile ↗
ORCID search ↗
New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem
AAAI 2024
·
Koji Ichikawa
DBLP profile ↗
ORCID search ↗
On the Minimax Regret for Contextual Linear Bandits and Multi-Armed Bandits with Expert Advice
NeurIPS 2024
·
Shinji Ito
Online $\textrm{L}{\natural }$-Convex Minimization
ECML-PKDD 2024
·
Ken Yokoyama
DBLP profile ↗
ORCID search ↗