2015 - Fellow of Alfred P. Sloan Foundation
The scientist’s investigation covers issues in Differential privacy, Theoretical computer science, Machine learning, Artificial intelligence and Mathematical economics. His Differential privacy study deals with the bigger picture of Algorithm. The study incorporates disciplines such as Learning theory, Classifier, Time complexity, Synthetic data and Computational problem in addition to Theoretical computer science.
The concepts of his Machine learning study are interwoven with issues in Field and Statistical inference. His study looks at the relationship between Mathematical economics and fields such as Regret, as well as how they intersect with chemical problems. His Privacy software research includes elements of Computational complexity theory and Data stream mining.
Aaron Roth mainly focuses on Differential privacy, Theoretical computer science, Mathematical optimization, Mathematical economics and Algorithm. His Differential privacy study is associated with Data mining. His work carried out in the field of Theoretical computer science brings together such families of science as Time complexity, Polynomial and Approximation algorithm.
His work on Maximization as part of general Mathematical optimization study is frequently connected to Bounded function, Set and Task, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them. His work is dedicated to discovering how Mathematical economics, Regret are connected with Artificial intelligence and other disciplines. As a member of one scientific family, Aaron Roth mostly works in the field of Mechanism design, focusing on Common value auction and, on occasion, Payment.
Aaron Roth mostly deals with Differential privacy, Theoretical computer science, Algorithm, Generalization and Mathematical optimization. The subject of his Differential privacy research is within the realm of Data mining. His work deals with themes such as Statistic and Synthetic data, which intersect with Data mining.
Aaron Roth has researched Theoretical computer science in several fields, including Interactivity, Mathematical proof, SIMPLE and Benchmark. His research integrates issues of Group, State, Minimax, Confidence interval and Point estimation in his study of Algorithm. As part of the same scientific family, he usually focuses on Mathematical optimization, concentrating on Oracle and intersecting with Regret and Distribution.
His main research concerns Theoretical computer science, Differential privacy, Constraint, Generalization and Sample. His studies in Theoretical computer science integrate themes in fields like Heuristics and Pointer. He undertakes interdisciplinary study in the fields of Differential privacy and Audit through his research.
His study in Constraint is interdisciplinary in nature, drawing from both Regret, Mathematical optimization and Distribution. His Sample research is multidisciplinary, incorporating perspectives in Mathematical economics, Task and Contrast. His Task research is multidisciplinary, incorporating elements of Algorithm and Heuristic.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
The Algorithmic Foundations of Differential Privacy
Cynthia Dwork;Aaron Roth.
(2014)
A learning theory approach to non-interactive database privacy
Avrim Blum;Katrina Ligett;Aaron Roth.
symposium on the theory of computing (2008)
A learning theory approach to noninteractive database privacy
Avrim Blum;Katrina Ligett;Aaron Roth.
Journal of the ACM (2013)
Fairness in Criminal Justice Risk Assessments: The State of the Art
Richard Berk;Hoda Heidari;Shahin Jabbari;Michael Kearns.
Sociological Methods & Research (2021)
The reusable holdout: Preserving validity in adaptive data analysis
Cynthia Dwork;Vitaly Feldman;Moritz Hardt;Toniann Pitassi.
Science (2015)
Interactive privacy via the median mechanism
Aaron Roth;Tim Roughgarden.
symposium on the theory of computing (2010)
Preserving Statistical Validity in Adaptive Data Analysis
Cynthia Dwork;Vitaly Feldman;Moritz Hardt;Toniann Pitassi.
symposium on the theory of computing (2015)
Differential Privacy: An Economic Method for Choosing Epsilon
Justin Hsu;Marco Gaboardi;Andreas Haeberlen;Sanjeev Khanna.
ieee computer security foundations symposium (2014)
The Frontiers of Fairness in Machine Learning.
Alexandra Chouldechova;Aaron Roth.
arXiv: Learning (2018)
Constrained non-monotone submodular maximization: offline and secretary algorithms
Anupam Gupta;Aaron Roth;Grant Schoenebeck;Kunal Talwar.
workshop on internet and network economics (2010)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
University of Pennsylvania
University of Pennsylvania
Carnegie Mellon University
University of California, Berkeley
Harvard University
Apple (United States)
University of Pennsylvania
Toyota Technological Institute at Chicago
University of Toronto
Stanford University
Portland State University
United States Naval Research Laboratory
Chevron (Netherlands)
University of Michigan–Ann Arbor
Ikerbasque
Johns Hopkins University
Columbia University Medical Center
Bigelow Laboratory For Ocean Sciences
University of Florida
Stanford University
Roche (Switzerland)
Vrije Universiteit Amsterdam
Max Planck Society
Catholic University of the Sacred Heart
Vrije Universiteit Amsterdam
University of Erlangen-Nuremberg