Zobrazeno 1 - 10
of 103
pro vyhledávání: '"Aaron Roth"'
Publikováno v:
The Journal of Privacy and Confidentiality, Vol 10, Iss 1 (2020)
There are now several large scale deployments of differential privacy used to collect statistical information about users. However, these deployments periodically recollect the data and recompute the statistics using algorithms designed for a single
Externí odkaz:
https://doaj.org/article/141e995e78144c58b21994c497749eb0
Publikováno v:
The Journal of Privacy and Confidentiality, Vol 9, Iss 2 (2019)
Traditional approaches to differential privacy assume a fixed privacy requirement ε for a computation, and attempt to maximize the accuracy of the computation subject to the privacy constraint. As differential privacy is increasingly deployed in pra
Externí odkaz:
https://doaj.org/article/7723d62d6968464c8b36cf44a71c9705
Autor:
Gilles Barthe, Christos Dimitrakakis, Marco Gaboardi, Andreas Haeberlen, Aaron Roth, Aleksandra B Slavković
Publikováno v:
The Journal of Privacy and Confidentiality, Vol 9, Iss 1 (2019)
The Theory and Practice of Differential Privacy workshop (TPDP 2016) was held in New York City, NY, USA on 23 June 2016 as part of ICML 2016. This is the program.
Externí odkaz:
https://doaj.org/article/88a8c00643dd484aba2587243ba8d803
Publikováno v:
The Journal of Privacy and Confidentiality, Vol 7, Iss 2 (2017)
We present a practical, differentially private algorithm for answering a large number of queries on high dimensional datasets. Like all algorithms for this task, ours necessarily has worst-case complexity exponential in the dimension of the data. How
Externí odkaz:
https://doaj.org/article/8061ee11d63245759d4f0645c1680942
Publikováno v:
ACM Transactions on Algorithms. 18:1-17
We prove a general connection between the communication complexity of two-player games and the sample complexity of their multi-player locally private analogues. We use this connection to prove sample complexity lower bounds for locally differentiall
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d51e4f3124d9094604ee38bffaa6a047
https://doi.org/10.1145/3459095
https://doi.org/10.1145/3459095
Autor:
Travis Dick, Cynthia Dwork, Michael Kearns, Terrance Liu, Aaron Roth, Giuseppe Vietri, Zhiwei Steven Wu
Publikováno v:
Proceedings of the National Academy of Sciences. 120
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::16f24837812861558f516d00a53534f0
https://doi.org/10.1073/pnas.2304263120
https://doi.org/10.1073/pnas.2304263120
Autor:
Paul W. Goldberg, Aaron Roth
We analyze the number of payoff queries needed to compute approximate equilibria of multi-player games. We find that query complexity is an effective tool for distinguishing the computational difficulty of alternative solution concepts, and we develo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9b85b70c9d71f370dfb7f1444b2f5394
https://ora.ox.ac.uk/objects/uuid:61b9c3b3-ae74-4e77-96d7-4f0ad91d04a4
https://ora.ox.ac.uk/objects/uuid:61b9c3b3-ae74-4e77-96d7-4f0ad91d04a4
Publikováno v:
Journal of the Royal Statistical Society Series B: Statistical Methodology. 84:50-54
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d8cda85b6ee31cd2f05903bd7b7d4cf6
https://doi.org/10.1111/rssb.12463
https://doi.org/10.1111/rssb.12463
Autor:
Scott E. Denmark, Casey L. Olen, Yang Wang, Bijay Shrestha, Adon C. Kwong, Aaron Roth, Brennan T. Rose
Publikováno v:
The Journal of Organic Chemistry. 86:3490-3534
A general procedure for the asymmetric synthesis of highly substituted 1,2-amino alcohols in high yield and diastereoselectivity is described that uses organometallic additions of a wide range of nucleophiles to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a5ac603ddcf819ade3001b1eb57337f8
https://doi.org/10.1021/acs.joc.0c02899
https://doi.org/10.1021/acs.joc.0c02899
Autor:
Aaron Roth, Michael Kearns
Publikováno v:
ACM SIGecom Exchanges. 18:31-36
In this letter, we summarize the research agenda that we survey in our recent book The Ethical Algorithm , which is intended for a general, nontechnical audience. At a high level, this research agenda proposes formalizing the ethical and social value
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d764441a2f5a048488f932b77c287903
https://doi.org/10.1145/3440959.3440966
https://doi.org/10.1145/3440959.3440966