( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Private Ad Modeling with DP-SGD.

, , , , , , , , и . AdKDD@KDD, том 3556 из CEUR Workshop Proceedings, CEUR-WS.org, (2023)

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.

Sudeep Kamath

Pritish Sinha

Keshav Kamath

Karkala Vasudeva Kamath

Karkala Vasudeva Kamath

 

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

Monotone Circuit Lower Bounds from Resolution., , , и . Electron. Colloquium Comput. Complex., (2017)Summary Reports Optimization in the Privacy Sandbox Attribution Reporting API., , , , , , и . CoRR, (2023)Optimal Unbiased Randomizers for Regression with Label Differential Privacy., , , , , , , и . CoRR, (2023)Connect the Dots: Tighter Discrete Approximations of Privacy Loss Distributions., , , , и . CoRR, (2022)Adventures in Monotone Complexity and TFNP., , , и . ITCS, том 124 из LIPIcs, стр. 38:1-38:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)On Differentially Private Counting on Trees., , , , и . ICALP, том 261 из LIPIcs, стр. 66:1-66:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)On User-Level Private Convex Optimization., , , , , и . ICML, том 202 из Proceedings of Machine Learning Research, стр. 11283-11299. PMLR, (2023)Quantifying the Benefit of Using Differentiable Learning over Tangent Kernels., , , и . ICML, том 139 из Proceedings of Machine Learning Research, стр. 7379-7389. PMLR, (2021)Limits on the Efficiency of (Ring) LWE based Non-Interactive Key Exchange., , , и . IACR Cryptol. ePrint Arch., (2020)On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem., , , и . CCC, том 169 из LIPIcs, стр. 19:1-19:42. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)