From post

A Fast Spectral Algorithm for Mean Estimation with Sub-Gaussian Rates.

, , , и . COLT, том 125 из Proceedings of Machine Learning Research, стр. 2598-2612. PMLR, (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.

 

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

Optimal Regularization can Mitigate Double Descent., , , и . ICLR, OpenReview.net, (2021)Near-optimal fitting of ellipsoids to random points., , , и . COLT, том 195 из Proceedings of Machine Learning Research, стр. 4235-4295. PMLR, (2023)Optimal Regularization Can Mitigate Double Descent., , , и . CoRR, (2020)Privately Estimating a Gaussian: Efficient, Robust, and Optimal., , , , и . STOC, стр. 483-496. ACM, (2023)A Succinct, Dynamic Data Structure for Proximity Queries on Point Sets., и . CCCG, Carleton University, Ottawa, Canada, (2014)Select and Permute: An Improved Online Framework for Scheduling to Minimize Weighted Completion Time., , , , и . LATIN, том 10807 из Lecture Notes in Computer Science, стр. 669-682. Springer, (2018)A Fast Spectral Algorithm for Mean Estimation with Sub-Gaussian Rates., , , и . COLT, том 125 из Proceedings of Machine Learning Research, стр. 2598-2612. PMLR, (2020)Efficient Algorithms for Certifying Lower Bounds on the Discrepancy of Random Matrices.. ITCS, том 251 из LIPIcs, стр. 98:1-98:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)