Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
AISTATS
/
Paper
Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection.
Lijie Chen
,
Jian Li
,
Mingda Qiao
Venue
A
AISTATS
Year
2017
Proceedings
AISTATS
DBLP record
conf/aistats/ChenLQ17 ↗
Browse the full
AISTATS paper archive
.