Author of the publication

New Oracle-Efficient Algorithms for Private Synthetic Data Release.

, , , , and . ICML, volume 119 of Proceedings of Machine Learning Research, page 9765-9774. 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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Differentially Private Submodular Maximization: Data Summarization in Disguise., , , and . ICML, volume 70 of Proceedings of Machine Learning Research, page 2478-2487. PMLR, (2017)Make Up Your Mind: The Price of Online Queries in Differential Privacy., , and . CoRR, (2016)Multiclass versus Binary Differentially Private PAC Learning., , and . NeurIPS, page 22943-22954. (2021)When is memorization of irrelevant training data necessary for high-accuracy learning?, , , , and . STOC, page 123-132. ACM, (2021)Dual Polynomials for Collision and Element Distinctness., and . Electron. Colloquium Comput. Complex., (2015)A Nearly Optimal Lower Bound on the Approximate Degree of AC0., and . SIAM J. Comput., (2020)Composable and versatile privacy via truncated CDP., , , and . STOC, page 74-86. ACM, (2018)Weighted Polynomial Approximations: Limits for Learning and Pseudorandomness., and . APPROX-RANDOM, volume 40 of LIPIcs, page 625-644. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Order-Revealing Encryption and the Hardness of Private Learning., and . IACR Cryptology ePrint Archive, (2015)Differentially Private Correlation Clustering., , and . ICML, volume 139 of Proceedings of Machine Learning Research, page 1136-1146. PMLR, (2021)