Lijie Chen
5 papers · 2016–2017 · 2 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓
🌍
Conference Polyglot
(2)
🌉
Interdisciplinary Bridge
🧭
Keyword Pioneer
🐣
Hot Topic Early Bird
🐝
Cross-Pollinator
(15)
Conferences
COLT (4)
AISTATS (1)
Top co-authors
Keywords
sample complexity
(5)
multi-armed bandit
(4)
best arm identification
(3)
stochastic process
(1)
stochastic bandit
(1)
pure exploration
(1)
matroid constraint
(1)
instance optimality
(1)
gap-entropy conjecture
(1)
instance optimal
(1)
elimination algorithm
(1)
gap entropy
(1)
combinatorial optimization
(1)
instance-wise optimality
(1)
arm selection
(1)
stochastic reward
(1)
Papers
Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection
AISTATS 2017
Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration
COLT 2017
Towards Instance Optimal Bounds for Best Arm Identification
COLT 2017
Open Problem: Best Arm Identification: Almost Instance-Wise Optimality and the Gap Entropy Conjecture
COLT 2016
Pure Exploration of Multi-armed Bandit Under Matroid Constraints
COLT 2016