Exact MCMC with differentially private moves: revisiting the penalty algorithm in a data privacy framework

Warning The system is temporarily closed to updates for reporting purpose.

Yıldırım, Sinan and Ermiş, Beyza (2019) Exact MCMC with differentially private moves: revisiting the penalty algorithm in a data privacy framework. Statistics and Computing . ISSN 0960-3174 (Print) 1573-1375 (Online) Published Online First http://dx.doi.org/10.1007/s11222-018-9847-x

This is the latest version of this item.

[img]PDF - Repository staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL: http://dx.doi.org/10.1007/s11222-018-9847-x


We view the penalty algorithm of Ceperley and Dewing (1999), a Markov chain Monte Carlo (MCMC) algorithm for Bayesian inference, in the con- text of data privacy. Specifically, we study differential privacy of the penalty algorithm and advocate its use for data privacy. The algorithm can be made differentially private while remaining exact in the sense that its target distribution is the true posterior distribution conditioned on the private data. We also show that in a model with independent observations the algorithm has desirable convergence and privacy properties that scale with data size. Two special cases are also investigated and privacy preserving schemes are proposed for those cases: (i) Data are distributed among several data owners who are interested in the inference of a com- mon parameter while preserving their data privacy. (ii) The data likelihood belongs to an exponential family. The results of our numerical experiments on the Beta- Bernoulli and the logistic regression models agree with the theoretical results.

Item Type:Article
Subjects:Q Science > QA Mathematics > QA273-280 Probabilities. Mathematical statistics
ID Code:37232
Deposited By:Sinan Yıldırım
Deposited On:25 Jul 2019 15:26
Last Modified:25 Jul 2019 15:26

Available Versions of this Item

Repository Staff Only: item control page