Kei Takemura
10 papers · 2019–2023 · 5 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+1 more ↓ Show less ↑
π Conference Polyglot Β· Silver π Interdisciplinary Bridge Β· Bronze πΊοΈ Taxonomy Completionist (10) π£ Hot Topic Early Bird π Century Club Β· Bronze
π₯
Unstoppable Β· Bronze
Top co-authors
Research topics
Keywords
regret bound
(9)
multi-armed bandit
(4)
online learning
(4)
online algorithm
(4)
linear bandit
(3)
adversarial environment
(2)
contextual bandit
(2)
stochastic optimization
(2)
stochastic process
(2)
upper confidence bound
(1)
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)
quadratic variation
(1)
reusable resource
(1)
Papers
An Exploration-by-Optimization Approach to Best of Both Worlds in Linear Bandits
NeurIPS 2023
Bandit Task Assignment with Unknown Processing Time
NeurIPS 2023
Best-of-Three-Worlds Linear Bandit Algorithm with Variance-Adaptive Regret Bounds
COLT 2023
Contextual Conservative Interleaving Bandits
ICML 2023
Online Task Assignment Problems with Reusable Resources
AAAI 2022
A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits
AISTATS 2021
Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions
AAAI 2021
Delay and Cooperation in Nonstochastic Linear Bandits
NeurIPS 2020
Improved Regret Bounds for Bandit Combinatorial Optimization
NeurIPS 2019
Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback
NeurIPS 2019