( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Locally Private Hypothesis Selection.

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

Manesh Gopinadhan

Kollappallil Velayudhan Gopinathan

Srikanth Reddy Gopireddy

 

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

Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs., , , и . ITCS, том 124 из LIPIcs, стр. 32:1-32:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Private Convex Optimization in General Norms., , , , и . CoRR, (2022)Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations., , и . SIAM J. Comput., 51 (3): 577-626 (2022)Generic Reed-Solomon Codes Achieve List-Decoding Capacity., , и . STOC, стр. 1488-1501. ACM, (2023)Private Convex Optimization via Exponential Mechanism., , и . COLT, том 178 из Proceedings of Machine Learning Research, стр. 1948-1989. PMLR, (2022)Differentially Private Fine-tuning of Language Models., , , , , , , , , и 2 other автор(ы). ICLR, OpenReview.net, (2022)Outlaw Distributions and Locally Decodable Codes., , и . Theory Comput., (2019)On the Number of Rich Lines in Truly High Dimensional Sets., и . SoCG, том 34 из LIPIcs, стр. 584-598. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Improved Field Size Bounds for Higher Order MDS Codes., , и . ISIT, стр. 1243-1248. IEEE, (2023)Selective Pre-training for Private Fine-tuning., , , , , , , и . Trans. Mach. Learn. Res., (2024)