Author of the publication

Pure Differentially Private Summation from Anonymous Messages.

, , , , , and . ITC, volume 163 of LIPIcs, page 15:1-15:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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

Communication-Rounds Tradeoffs for Common Randomness and Secret Key Generation., , , and . Electron. Colloquium Comput. Complex., (2018)Size-Independent Sample Complexity of Neural Networks., , and . COLT, volume 75 of Proceedings of Machine Learning Research, page 297-299. PMLR, (2018)Fast rates for nonparametric online learning: from realizability to learning in games., and . STOC, page 846-859. ACM, (2022)Independent Policy Gradient Methods for Competitive Reinforcement Learning., , and . NeurIPS, (2020)Learning in Observable POMDPs, without Computationally Intractable Oracles., , and . NeurIPS, (2022)Differentially Private Nonparametric Regression Under a Growth Condition.. COLT, volume 134 of Proceedings of Machine Learning Research, page 2149-2192. PMLR, (2021)Is Efficient PAC Learning Possible with an Oracle That Responds 'Yes' or 'No'?, and . CoRR, (2024)Round Complexity of Common Randomness Generation: The Amortized Setting., and . SODA, page 1076-1095. SIAM, (2020)Near-tight closure b ounds for the Littlestone and threshold dimensions., , , and . ALT, volume 132 of Proceedings of Machine Learning Research, page 686-696. PMLR, (2021)Can Q-learning be Improved with Advice?, and . COLT, volume 178 of Proceedings of Machine Learning Research, page 4548-4619. PMLR, (2022)