mlsanityData to 14 Oct 2026

Differentially Private Markov Chain Monte Carlo

arXiv 1901.10275 ↗First posted 29 Jan 2019stat.ML cs.CR cs.LGcited by 18

Not on the map. Why?

Abstract (arXiv)

Recent developments in differentially private (DP) machine learning and DP Bayesian learning have enabled learning under strong privacy guarantees for the training data subjects. In this paper, we further extend the applicability of DP Bayesian learning by presenting the first general DP Markov chain Monte Carlo (MCMC) algorithm whose privacy-guarantees are not subject to unrealistic assumptions on Markov chain convergence and that is applicable to posterior inference in arbitrary models. Our algorithm is based on a decomposition of the Barker acceptance test that allows evaluating the R'enyi DP privacy cost of the accept-reject choice. We further show how to improve the DP guarantee through data subsampling and approximate acceptance tests.

Key facts. Cited by 18 papers in the map (data through 14 Oct 2026). First posted on arXiv 29 Jan 2019.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 3; 2022: 5; 2023: 5; 2024: 3; 2025: 2.

18 papers.

Sort: