Baekjin Kim
4 papers · 2019–2022 · 3 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 ↓
๐
Conference Polyglot ยท Bronze
๐
Interdisciplinary Bridge ยท Bronze
๐บ๏ธ
Taxonomy Completionist
(14)
๐ฃ
Hot Topic Early Bird
Venues
Top co-authors
Research topics
Keywords
differential privacy
(1)
stochastic optimization
(1)
online learning
(1)
adversarial optimization
(1)
pac learning
(1)
dynamic regret
(1)
kernel approximation
(1)
regret minimization
(1)
gaussian process
(1)
multi-class classification
(1)
thompson sampling
(1)
multi-armed bandit
(1)
upper confidence bound
(1)
regret bound
(1)
bandit optimization
(1)
sublinear regret
(1)
optimistic algorithm
(1)
linear bandit
(1)
littlestone dimension
(1)
randomized exploration
(1)
Papers
Weighted Gaussian Process Bandits for Non-stationary Environments
AISTATS 2022
On the Equivalence between Online and Private Learnability beyond Binary Classification
NeurIPS 2020
Randomized Exploration for Non-Stationary Stochastic Linear Bandits
UAI 2020
On the Optimality of Perturbations in Stochastic and Adversarial Multi-armed Bandit Problems
NeurIPS 2019