报告人：Weijie Su（University of Pennsylvania）
时间：2022-03-24 10:00-11:30
地点：Tencent Meeting（943 727 127）
Abstract:
Privacy-preserving data analysis has been put on a firm mathematical foundation since the introduction of differential privacy (DP) in 2006. This privacy definition, however, has some well-known weaknesses: notably, it does not tightly handle composition. In this talk, we propose a relaxation of DP that we term "f-DP", which has a number of appealing properties and avoids some of the difficulties associated with prior relaxations. This relaxation allows for lossless reasoning about composition and post-processing, and notably, a direct way to analyze privacy amplification by subsampling. We define a canonical single-parameter family of definitions within our class that is termed "Gaussian Differential Privacy", based on hypothesis testing of two shifted normal distributions. We prove that this family is focal to f-DP by introducing a central limit theorem, which shows that the privacy guarantees of any hypothesis-testing based definition of privacy converge to Gaussian differential privacy in the limit under composition. From a non-asymptotic standpoint, we introduce the Edgeworth Accountant, an analytical approach to compose $f$-DP guarantees of private algorithms. Finally, we demonstrate the use of the tools we develop by giving an improved analysis of the privacy guarantees of noisy stochastic gradient descent.
Biography:
Weijie Su is an Assistant Professor in the Wharton Statistics and Data Science Department and, by courtesy, in the Department of Computer and Information Science, at the University of Pennsylvania. He is a co-director of Penn Research in Machine Learning. Prior to joining Penn, he received his Ph.D. in statistics from Stanford University in 2016 and his bachelor’s degree in mathematics from Peking University in 2011. His research interests span multiple testing, privacy-preserving data analysis, optimization, high-dimensional statistics, and deep learning theory. He is a recipient of the Stanford Theodore W. Anderson Dissertation Award in Theoretical Statistics in 2016, an NSF CAREER Award in 2019, an Alfred Sloan Research Fellowship in 2020, and the Society for Industrial and Applied Mathematics (SIAM) Early Career Prize in Data Science in 2022.
Tencent Meeting：https://meeting.tencent.com/dm/quzVSXMoFmP5
Meeting ID：943 727 127
