( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On Generalization Error Bounds of Noisy Gradient Methods for Non-Convex Learning.

, , и . ICLR, OpenReview.net, (2020)

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.

Linhan Qiao

Miao Qiao

Wenchao Qiao

Wenbao Qiao

Fei Qiao

 

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

Online Pen Testing., и . ITCS, том 251 из LIPIcs, стр. 91:1-91:26. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)A Combinatorial Approach to Robust PCA., , и . CoRR, (2023)Collaborative PAC Learning., , , и . NIPS, стр. 2392-2401. (2017)Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration., , , , и . COLT, том 65 из Proceedings of Machine Learning Research, стр. 482-534. PMLR, (2017)Do Outliers Ruin Collaboration?. ICML, том 80 из Proceedings of Machine Learning Research, стр. 4177-4184. PMLR, (2018)A Combinatorial Approach to Robust PCA., , и . ITCS, том 287 из LIPIcs, стр. 70:1-70:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Towards Instance Optimal Bounds for Best Arm Identification., , и . COLT, том 65 из Proceedings of Machine Learning Research, стр. 535-592. PMLR, (2017)Stronger calibration lower bounds via sidestepping., и . STOC, стр. 456-466. ACM, (2021)On Generalization Error Bounds of Noisy Gradient Methods for Non-Convex Learning., , и . ICLR, OpenReview.net, (2020)Decision Tree Heuristics Can Fail, Even in the Smoothed Setting., , , и . APPROX-RANDOM, том 207 из LIPIcs, стр. 45:1-45:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)