%0 Conference Paper %1 conf/aistats/ChenLQ17 %A Chen, Lijie %A Li, Jian %A Qiao, Mingda %B AISTATS %D 2017 %E Singh, Aarti %E Zhu, Xiaojin (Jerry) %I PMLR %K dblp %P 101-110 %T Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection. %U http://dblp.uni-trier.de/db/conf/aistats/aistats2017.html#ChenLQ17 %V 54

@inproceedings{conf/aistats/ChenLQ17, added-at = {2021-02-05T00:00:00.000+0100}, author = {Chen, Lijie and Li, Jian and Qiao, Mingda}, biburl = {https://www.bibsonomy.org/bibtex/2262092ddef8a11696e0a684474a31bd9/dblp}, booktitle = {AISTATS}, crossref = {conf/aistats/2017}, editor = {Singh, Aarti and Zhu, Xiaojin (Jerry)}, ee = {http://proceedings.mlr.press/v54/chen17a.html}, interhash = {440058b6828445dc17c4d186244b7bb7}, intrahash = {262092ddef8a11696e0a684474a31bd9}, keywords = {dblp}, pages = {101-110}, publisher = {PMLR}, series = {Proceedings of Machine Learning Research}, timestamp = {2024-04-10T14:45:16.000+0200}, title = {Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection.}, url = {http://dblp.uni-trier.de/db/conf/aistats/aistats2017.html#ChenLQ17}, volume = 54, year = 2017 }