Kei Takemura
10 papers · 2019–2023 · 5 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+3 more ↓ Show less ↑
π Interdisciplinary Bridge π§ Keyword Pioneer πΊοΈ Taxonomy Completionist (10) π£ Hot Topic Early Bird π Conference Polyglot (5)
π
Cross-Pollinator
(12)
π
Century Club
(10)
π₯
Unstoppable
(5)
Conferences
NIPS (5)
AAAI (2)
AISTATS (1)
COLT (1)
ICML (1)
Top co-authors
Keywords
regret bound
(9)
online algorithm
(4)
multi-armed bandit
(4)
linear bandit
(3)
online learning
(3)
stochastic optimization
(2)
stochastic process
(2)
adversarial environment
(2)
contextual bandit
(2)
delayed feedback
(1)
combinatorial semi-bandit
(1)
bandit algorithm
(1)
competitive analysis
(1)
online matching
(1)
linear model
(1)
reward estimation
(1)
stochastic environment
(1)
reusable resource
(1)
performance constraint
(1)
conservative algorithm
(1)
Papers
Contextual Conservative Interleaving Bandits
ICML 2023
Best-of-Three-Worlds Linear Bandit Algorithm with Variance-Adaptive Regret Bounds
COLT 2023
Bandit Task Assignment with Unknown Processing Time
NIPS 2023
An Exploration-by-Optimization Approach to Best of Both Worlds in Linear Bandits
NIPS 2023
Online Task Assignment Problems with Reusable Resources
AAAI 2022
Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions
AAAI 2021
A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits
AISTATS 2021
Delay and Cooperation in Nonstochastic Linear Bandits
NIPS 2020
Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback
NIPS 2019
Improved Regret Bounds for Bandit Combinatorial Optimization
NIPS 2019