首页 | 本学科首页   官方微博 | 高级检索  
     


ABCDP: Approximate Bayesian Computation with Differential Privacy
Authors:Mijung Park  Margarita Vinaroz  Wittawat Jitkrittum
Affiliation:1.Computer Science, University of British Columbia, Vancouver, BC V6T 1Z4, Canada;2.Max Planck Institute for Intelligent Systems, 72076 Tübingen, Germany;3.Department of Computer Science, University of Tübingen, 72076 Tübingen, Germany;4.Google Research, 80636 Munich, Germany;
Abstract:We developed a novel approximate Bayesian computation (ABC) framework, ABCDP, which produces differentially private (DP) and approximate posterior samples. Our framework takes advantage of the sparse vector technique (SVT), widely studied in the differential privacy literature. SVT incurs the privacy cost only when a condition (whether a quantity of interest is above/below a threshold) is met. If the condition is sparsely met during the repeated queries, SVT can drastically reduce the cumulative privacy loss, unlike the usual case where every query incurs the privacy loss. In ABC, the quantity of interest is the distance between observed and simulated data, and only when the distance is below a threshold can we take the corresponding prior sample as a posterior sample. Hence, applying SVT to ABC is an organic way to transform an ABC algorithm to a privacy-preserving variant with minimal modification, but yields the posterior samples with a high privacy level. We theoretically analyzed the interplay between the noise added for privacy and the accuracy of the posterior samples. We apply ABCDP to several data simulators and show the efficacy of the proposed framework.
Keywords:approximate Bayesian computation (ABC)   differential privacy (DP)   sparse vector technique (SVT)
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号