Andrea Locatelli
6 papers · 2016–2019 · 4 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
(10)
๐ฃ
Hot Topic Early Bird
Venues
Top co-authors
Research topics
Keywords
multi-armed bandit
(3)
fixed budget
(2)
active learning
(2)
best arm identification
(1)
minimax optimal
(1)
cumulative regret
(1)
regret bound
(1)
lower bound
(1)
decision boundary
(1)
confidence set
(1)
stochastic bandit
(1)
pure exploration
(1)
error bound
(1)
rank adaptation
(1)
optimal algorithm
(1)
thresholding bandit
(1)
adaptive strategy
(1)
multivariate data
(1)
x-armed bandit
(1)
smoothness adaptation
(1)
Papers
Active multiple matrix completion with adaptive confidence sets
AISTATS 2019
Rotting bandits are no harder than stochastic ones
AISTATS 2019
Adaptivity to Smoothness in X-armed bandits
COLT 2018
An Adaptive Strategy for Active Learning with Smooth Decision Boundary
ALT 2018
An optimal algorithm for the Thresholding Bandit Problem
ICML 2016
Tight (Lower) Bounds for the Fixed Budget Best Arm Identification Bandit Problem
COLT 2016