{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,19]],"date-time":"2026-08-19T17:52:32Z","timestamp":1787161952228,"version":"3.56.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Stat Comput"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s11222-018-9847-x","type":"journal-article","created":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:16:41Z","timestamp":1546301801000},"page":"947-963","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Exact MCMC with differentially private moves"],"prefix":"10.1007","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7980-8990","authenticated-orcid":false,"given":"Sinan","family":"Y\u0131ld\u0131r\u0131m","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Beyza","family":"Ermi\u015f","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,1,1]]},"reference":[{"key":"9847_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Chu, A., Goodfellow, I., McMahan, H.B., Mironov, I., Talwar, K., Zhang, L.: Deep learning with differential privacy. In: Conference on Computer and Communications Security, pp. 308\u2013318. ACM SIGSAC (2016)","DOI":"10.1145\/2976749.2978318"},{"key":"9847_CR2","unstructured":"Andrieu, C., Doucet, A., Y\u0131ld\u0131r\u0131m, S., Chopin, N.: On the utility of Metropolis\u2013Hastings with asymmetric acceptance ratio. Technical report (2018). \n                    arXiv:1803.09527"},{"issue":"1","key":"9847_CR3","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1080\/10485250601033214","volume":"41","author":"YF Atchad\u00e9","year":"2007","unstructured":"Atchad\u00e9, Y.F., Perron, F.: On the geometric ergodicity of Metropolis\u2013Hastings algorithms. Statistics 41(1), 77\u201384 (2007)","journal-title":"Statistics"},{"issue":"6","key":"9847_CR4","doi-asserted-by":"publisher","first-page":"1213","DOI":"10.1007\/s11222-015-9598-x","volume":"26","author":"J Bierkens","year":"2016","unstructured":"Bierkens, J.: Non-reversible Metropolis\u2013Hastings. Stat. Comput. 26(6), 1213\u20131228 (2016)","journal-title":"Stat. Comput."},{"key":"9847_CR5","doi-asserted-by":"crossref","unstructured":"Bun, M., Steinke, T.: Concentrated differential privacy: simplifications, extensions, and lower bounds. In: Proceedings, Part I, of the 14th International Conference on Theory of Cryptography, vol. 9985, pp. 635\u2013658. Springer, New York (2016)","DOI":"10.1007\/978-3-662-53641-4_24"},{"issue":"20","key":"9847_CR6","doi-asserted-by":"publisher","first-page":"9812","DOI":"10.1063\/1.478034","volume":"110","author":"DM Ceperley","year":"1999","unstructured":"Ceperley, D.M., Dewing, M.: The penalty method for random walks with uncertain energies. J. Chem. Phys. 110(20), 9812\u20139820 (1999)","journal-title":"J. Chem. Phys."},{"key":"9847_CR7","doi-asserted-by":"crossref","unstructured":"Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. In: Halevi, S., Rabin, T. (eds.) Theory of Cryptography. TCC 2006. Lecture Notes in Computer Science, vol. 3876, pp. 265\u2013284. Springer, Berlin, Heidelberg (2006)","DOI":"10.1007\/11681878_14"},{"issue":"3\u20134","key":"9847_CR8","first-page":"211","volume":"9","author":"C Dwork","year":"2013","unstructured":"Dwork, C., Roth, A.: The algorithmic foundations of differential privacy. Theor. Comput. Sci. 9(3\u20134), 211\u2013407 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"9847_CR9","unstructured":"Dwork, C., Rothblum, G.N.: Concentrated differential privacy. Technical report (2016). \n                    arXiv:1603.01887v2"},{"key":"9847_CR10","doi-asserted-by":"crossref","unstructured":"Dwork, C., Rothblum, G.N., Vadhan, S.: Boosting and differential privacy. In: 2010 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 51\u201360 (2010)","DOI":"10.1109\/FOCS.2010.12"},{"key":"9847_CR11","unstructured":"Foulds, J., Geumlek, J., an\u00a0Kamalika\u00a0Chaudhuri, M.W.: On the theory and practice of privacy-preserving Bayesian data analysis. Technical report (2016). \n                    arxiv:1603.07294"},{"key":"9847_CR12","first-page":"5289","volume-title":"Advances in Neural Information Processing Systems","author":"J Geumlek","year":"2017","unstructured":"Geumlek, J., Song, S., Chaudhuri, K.: Renyi differential privacy mechanisms for posterior sampling. In: Guyon, I., Luxburg, U.V., Bengio, S., Wallach, H., Fergus, R., Vishwanathan, S., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol. 30, pp. 5289\u20135298. Curran Associates Inc, Red Hook (2017)"},{"issue":"4","key":"9847_CR13","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1023\/A:1008880707168","volume":"8","author":"P Gustafson","year":"1998","unstructured":"Gustafson, P.: A guided walk Metropolis algorithm. Stat. Comput. 8(4), 357\u2013364 (1998)","journal-title":"Stat. Comput."},{"issue":"1","key":"9847_CR14","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1093\/biomet\/57.1.97","volume":"52","author":"WK Hastings","year":"1970","unstructured":"Hastings, W.K.: Monte Carlo sampling methods using Markov chains and their applications. Biometrika 52(1), 97\u2013109 (1970)","journal-title":"Biometrika"},{"key":"9847_CR15","first-page":"3226","volume-title":"Advances in Neural Information Processing Systems","author":"M Heikkil\u00e4","year":"2017","unstructured":"Heikkil\u00e4, M., Lagerspetz, E., Kaski, S., Shimizu, K., Tarkoma, S., Honkela, A.: Differentially private Bayesian learning on distributed data. In: Guyon, I., Luxburg, U.V., Bengio, S., Wallach, H., Fergus, R., Vishwanathan, S., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol. 30, pp. 3226\u20133235. Curran Associates Inc, Red Hook (2017)"},{"key":"9847_CR16","first-page":"956","volume-title":"Advances in Neural Information Processing Systems","author":"K Minami","year":"2016","unstructured":"Minami, K., Arai, H., Sato, I., Nakagawa, H.: Differential privacy without sensitivity. In: Lee, D.D., Sugiyama, M., Luxburg, U.V., Guyon, I., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol. 29, pp. 956\u2013964. Curran Associates Inc, Red Hook (2016)"},{"key":"9847_CR17","doi-asserted-by":"crossref","unstructured":"Mironov, I.: R\u00e9nyi differential privacy. In: 2017 IEEE 30th Computer Security Foundations Symposium (CSF), pp. 263\u2013275 (2017)","DOI":"10.1109\/CSF.2017.11"},{"key":"9847_CR18","unstructured":"Nicholls, G., Fox, C., Watt, A.: Coupled MCMC with a randomised acceptance probability. Technical report (2012). \n                    arXiv:1205.6857"},{"key":"9847_CR19","unstructured":"Park, M., Foulds, J.R., Chaudhuri, K., Welling, M.: Variational Bayes in private settings (VIPS). Technical report (2016). \n                    arXiv:1611.00340v3"},{"key":"9847_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4145-2","volume-title":"Monte Carlo Statistical Methods","author":"CP Robert","year":"2004","unstructured":"Robert, C.P., Casella, G.: Monte Carlo Statistical Methods, 2nd edn. Springer, New York (2004)","edition":"2"},{"key":"9847_CR21","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1093\/biomet\/83.1.95","volume":"83","author":"G Roberts","year":"1996","unstructured":"Roberts, G., Tweedie, R.: Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms. Biometrika 83, 95\u2013110 (1996)","journal-title":"Biometrika"},{"key":"9847_CR22","unstructured":"Wang, Y.-X., Fienberg, S., Smola, A.: Privacy for free: posterior sampling and stochastic gradient Monte Carlo. In: Blei, D., Bach, F. (eds), Proceedings of the 32nd International Conference on Machine Learning (ICML-15), Workshop and Conference Proceedings, pp. 2493\u20132502. JMLR (2015)"},{"key":"9847_CR23","unstructured":"Welling, M., Teh, Y.W.: Bayesian learning via stochastic gradient langevin dynamics. In: Getoor, L., Scheffer, T. (eds), Proceedings of 28th International Conference on Machine Learning (ICML 2011), ICML \u201911, pp. 681\u2013688. ACM (2011)"}],"container-title":["Statistics and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-018-9847-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11222-018-9847-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-018-9847-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:43:16Z","timestamp":1577839396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11222-018-9847-x"}},"subtitle":["Revisiting the penalty algorithm in a data privacy framework"],"short-title":[],"issued":{"date-parts":[[2019,1,1]]},"references-count":23,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["9847"],"URL":"https:\/\/doi.org\/10.1007\/s11222-018-9847-x","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"value":"0960-3174","type":"print"},{"value":"1573-1375","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,1]]},"assertion":[{"value":"2 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 December 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}