%0 Conference Paper %1 conf/colt/CaoK19 %A Cao, Tongyi %A Krishnamurthy, Akshay %B COLT %D 2019 %E Beygelzimer, Alina %E Hsu, Daniel %I PMLR %K dblp %P 558-588 %T Disagreement-Based Combinatorial Pure Exploration: Sample Complexity Bounds and an Efficient Algorithm. %U http://dblp.uni-trier.de/db/conf/colt/colt2019.html#CaoK19 %V 99

@inproceedings{conf/colt/CaoK19, added-at = {2019-07-08T00:00:00.000+0200}, author = {Cao, Tongyi and Krishnamurthy, Akshay}, biburl = {https://www.bibsonomy.org/bibtex/26fb070036cca52b59a90870f82312608/dblp}, booktitle = {COLT}, crossref = {conf/colt/2019}, editor = {Beygelzimer, Alina and Hsu, Daniel}, ee = {http://proceedings.mlr.press/v99/cao19a.html}, interhash = {05425a93fab4bc47ba1b38e28e451cb1}, intrahash = {6fb070036cca52b59a90870f82312608}, keywords = {dblp}, pages = {558-588}, publisher = {PMLR}, series = {Proceedings of Machine Learning Research}, timestamp = {2019-07-09T11:40:40.000+0200}, title = {Disagreement-Based Combinatorial Pure Exploration: Sample Complexity Bounds and an Efficient Algorithm.}, url = {http://dblp.uni-trier.de/db/conf/colt/colt2019.html#CaoK19}, volume = 99, year = 2019 }