From post

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

, , и . AISTATS, том 54 из Proceedings of Machine Learning Research, стр. 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.

 

Другие публикации лиц с тем же именем

Platforms for Efficient and Incentive-Aware Collaboration., , и . CoRR, (2024)A Combinatorial Approach to Robust PCA., , и . ITCS, том 287 из LIPIcs, стр. 70:1-70:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Stronger calibration lower bounds via sidestepping., и . STOC, стр. 456-466. ACM, (2021)Towards Instance Optimal Bounds for Best Arm Identification., , и . COLT, том 65 из Proceedings of Machine Learning Research, стр. 535-592. PMLR, (2017)Do Outliers Ruin Collaboration?. ICML, том 80 из Proceedings of Machine Learning Research, стр. 4177-4184. PMLR, (2018)A Combinatorial Approach to Robust PCA., , и . CoRR, (2023)Collaborative PAC Learning., , , и . NIPS, стр. 2392-2401. (2017)Online Pen Testing., и . ITCS, том 251 из LIPIcs, стр. 91:1-91:26. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration., , , , и . COLT, том 65 из Proceedings of Machine Learning Research, стр. 482-534. PMLR, (2017)Learning Discrete Distributions from Untrusted Batches., и . CoRR, (2017)