Aaron Roth
Aaron Roth
Professor of Computer Science, University of Pennsylvania
Verified email at cis.upenn.edu - Homepage
Title
Cited by
Cited by
Year
The Algorithmic Foundations of Differential Privacy
C Dwork, A Roth
Foundations and Trends® in Theoretical Computer Science 9 (3-4), 211-407, 2014
25832014
A learning theory approach to non-interactive database privacy
A Blum, K Ligett, A Roth
Journal of the ACM (JACM) 60 (2), 12:1-12:25, 2013
6662013
Selling privacy at auction
A Ghosh, A Roth
Games and Economic Behavior 91, 334-346, 2015
282*2015
Fairness in criminal justice risk assessments: The state of the art
R Berk, H Heidari, S Jabbari, M Kearns, A Roth
Sociological Methods & Research, 0049124118782533, 2018
2682018
Interactive privacy via the median mechanism
A Roth, T Roughgarden
Proceedings of the 42nd ACM symposium on Theory of computing, 765-774, 2010
2522010
Preserving statistical validity in adaptive data analysis
C Dwork, V Feldman, M Hardt, T Pitassi, O Reingold, AL Roth
Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015
2422015
The reusable holdout: Preserving validity in adaptive data analysis
C Dwork, V Feldman, M Hardt, T Pitassi, O Reingold, A Roth
Science 349 (6248), 636-638, 2015
2402015
Preventing fairness gerrymandering: Auditing and learning for subgroup fairness
M Kearns, S Neel, A Roth, ZS Wu
International Conference on Machine Learning, 2564-2572, 2018
2202018
Fairness in learning: Classic and contextual bandits
M Joseph, M Kearns, JH Morgenstern, A Roth
Advances in Neural Information Processing Systems, 325-333, 2016
2152016
Differential privacy: An economic method for choosing epsilon
J Hsu, M Gaboardi, A Haeberlen, S Khanna, A Narayan, BC Pierce, ...
2014 IEEE 27th Computer Security Foundations Symposium, 398-410, 2014
1832014
Constrained non-monotone submodular maximization: Offline and secretary algorithms
A Gupta, A Roth, G Schoenebeck, K Talwar
International Workshop on Internet and Network Economics, 246-257, 2010
1532010
Generalization in adaptive data analysis and holdout reuse
C Dwork, V Feldman, M Hardt, T Pitassi, O Reingold, A Roth
Advances in Neural Information Processing Systems, 2350-2358, 2015
1522015
Iterative constructions and private data release
A Gupta, A Roth, J Ullman
Theory of Cryptography (TCC), 2012
1502012
Differentially private combinatorial optimization
A Gupta, K Ligett, F McSherry, A Roth, K Talwar
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete …, 2010
149*2010
Regret minimization and the price of total anarchy
A Blum, MT Hajiaghayi, K Ligett, A Roth
Proceedings of the 40th annual ACM symposium on Theory of computing, 373-382, 2008
1482008
Privately releasing conjunctions and the statistical query barrier
A Gupta, M Hardt, A Roth, J Ullman
SIAM Journal on Computing, 2013
1292013
A snapshot of the frontiers of fairness in machine learning
A Chouldechova, A Roth
Communications of the ACM 63 (5), 82-89, 2020
119*2020
Robust mediators in large games
M Kearns, MM Pai, R Rogers, A Roth, J Ullman
arXiv preprint arXiv:1512.02698, 2015
106*2015
Distributed private heavy hitters
J Hsu, S Khanna, A Roth
International Colloquium on Automata, Languages, and Programming, 461-472, 2012
932012
A convex framework for fair regression
R Berk, H Heidari, S Jabbari, M Joseph, M Kearns, J Morgenstern, S Neel, ...
arXiv preprint arXiv:1706.02409, 2017
922017
The system can't perform the operation now. Try again later.
Articles 1–20