Author of the publication

Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection.

, , and . AISTATS, volume 54 of Proceedings of Machine Learning Research, page 101-110. PMLR, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Platforms for Efficient and Incentive-Aware Collaboration., , and . CoRR, (2024)A Combinatorial Approach to Robust PCA., , and . ITCS, volume 287 of LIPIcs, page 70:1-70:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Stronger calibration lower bounds via sidestepping., and . STOC, page 456-466. ACM, (2021)Towards Instance Optimal Bounds for Best Arm Identification., , and . COLT, volume 65 of Proceedings of Machine Learning Research, page 535-592. PMLR, (2017)Do Outliers Ruin Collaboration?. ICML, volume 80 of Proceedings of Machine Learning Research, page 4177-4184. PMLR, (2018)A Combinatorial Approach to Robust PCA., , and . CoRR, (2023)Online Pen Testing., and . ITCS, volume 251 of LIPIcs, page 91:1-91:26. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Collaborative PAC Learning., , , and . NIPS, page 2392-2401. (2017)Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration., , , , and . COLT, volume 65 of Proceedings of Machine Learning Research, page 482-534. PMLR, (2017)On Generalization Error Bounds of Noisy Gradient Methods for Non-Convex Learning., , and . ICLR, OpenReview.net, (2020)