Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Goren, Yusuf"'
Autor:
Talwar, Kunal, Wang, Shan, McMillan, Audra, Jina, Vojta, Feldman, Vitaly, Bansal, Pansy, Basile, Bailey, Cahill, Aine, Chan, Yi Sheng, Chatzidakis, Mike, Chen, Junye, Chick, Oliver, Chitnis, Mona, Ganta, Suman, Goren, Yusuf, Granqvist, Filip, Guo, Kristine, Jacobs, Frederic, Javidbakht, Omid, Liu, Albert, Low, Richard, Mascenik, Dan, Myers, Steve, Park, David, Park, Wonhee, Parsa, Gianni, Pauly, Tommy, Priebe, Christian, Rishi, Rehan, Rothblum, Guy, Scaria, Michael, Song, Linmao, Song, Congzheng, Tarbe, Karl, Vogt, Sebastian, Winstrom, Luke, Zhou, Shundong
We revisit the problem of designing scalable protocols for private statistics and private federated learning when each device holds its private data. Locally differentially private algorithms require little trust but are (provably) limited in their u
Externí odkaz:
http://arxiv.org/abs/2307.15017
Autor:
McMillan, Audra, Javidbakht, Omid, Talwar, Kunal, Briggs, Elliot, Chatzidakis, Mike, Chen, Junye, Duchi, John, Feldman, Vitaly, Goren, Yusuf, Hesse, Michael, Jina, Vojta, Katti, Anil, Liu, Albert, Lyford, Cheney, Meyer, Joey, Palmer, Alex, Park, David, Park, Wonhee, Parsa, Gianni, Pelzl, Paul, Rishi, Rehan, Song, Congzheng, Wang, Shan, Zhou, Shundong
Privately learning statistics of events on devices can enable improved user experience. Differentially private algorithms for such problems can benefit significantly from interactivity. We argue that an aggregation protocol can enable an interactive
Externí odkaz:
http://arxiv.org/abs/2211.10082
Autor:
Goren, Yusuf
Publikováno v:
Goren, Yusuf. (2015). Counting Periodic Orbits: Conley Conjecture for Lagrangian Correspondences and Resonance Relations for Closed Reeb Orbits. UC Santa Cruz: Mathematics. Retrieved from: http://www.escholarship.org/uc/item/6fh7r5kh
The thesis is centered around the theme of periodic orbits of Hamiltonian systems. More precisely, we prove that on a closed symplectic Calabi--Yau manifold every Lagrangian correspondence Hamiltonian isotopic to the diagonal and satisfying some non-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______325::2bfd34493954c7eed7fb8d1bc6c5a70b
http://n2t.net/ark:/13030/m54r02p0
http://n2t.net/ark:/13030/m54r02p0
Publikováno v:
2015 International Conference on Computing, Networking & Communications (ICNC); 2015, p308-314, 7p