Andrea Locatelli
6 papers · 2016–2019 · 4 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+2 more ↓ Show less ↑
π Cross-Pollinator (9) π Interdisciplinary Bridge πΊοΈ Taxonomy Completionist (10) π Conference Polyglot (4) π§ Keyword Pioneer
π£
Hot Topic Early Bird
π
Keyword Champion
(2)
Conferences
AISTATS (2)
COLT (2)
ALT (1)
ICML (1)
Top co-authors
Keywords
multi-armed bandit
(3)
active learning
(2)
fixed budget
(2)
best arm identification
(1)
minimax optimal
(1)
cumulative regret
(1)
label complexity
(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 datum
(1)
x-armed bandit
(1)
Papers
Active multiple matrix completion with adaptive confidence sets
AISTATS 2019
Rotting bandits are no harder than stochastic ones
AISTATS 2019
An Adaptive Strategy for Active Learning with Smooth Decision Boundary
ALT 2018
Adaptivity to Smoothness in X-armed bandits
COLT 2018
Tight (Lower) Bounds for the Fixed Budget Best Arm Identification Bandit Problem
COLT 2016
An optimal algorithm for the Thresholding Bandit Problem
ICML 2016