{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T10:04:59Z","timestamp":1758708299587},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319453804"},{"type":"electronic","value":"9783319453811"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-45381-1_10","type":"book-chapter","created":{"date-parts":[[2016,8,30]],"date-time":"2016-08-30T04:47:33Z","timestamp":1472532453000},"page":"121-134","source":"Crossref","is-referenced-by-count":21,"title":["On-Average KL-Privacy and Its Equivalence to Generalization for Max-Entropy Mechanisms"],"prefix":"10.1007","author":[{"given":"Yu-Xiang","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Lei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen E.","family":"Fienberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,31]]},"reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-4076(81)90071-3","volume":"16","author":"H Akaike","year":"1981","unstructured":"Akaike, H.: Likelihood of a model and information criteria. J. Econometrics 16(1), 3\u201314 (1981)","journal-title":"J. Econometrics"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/11776420_13","volume-title":"Learning Theory","author":"Y Altun","year":"2006","unstructured":"Altun, Y., Smola, A.J.: Unifying divergence minimization and statistical inference via convex duality. In: Lugosi, G., Simon, H.U. (eds.) COLT 2006. LNCS (LNAI), vol. 4005, pp. 139\u2013153. Springer, Heidelberg (2006)"},{"key":"10_CR3","unstructured":"Anderson, N.: \u201canonymized\u201d data really isn\u2019t and here\u2019s why not (2009). http:\/\/arstechnica.com\/tech-policy\/2009\/09\/your-secrets-live-online-in-databases-of-ruin\/"},{"key":"10_CR4","unstructured":"Barber, R.F., Duchi, J.C.: Privacy and statistical risk: Formalisms and minimax bounds. arXiv preprint arXiv:1412.4451 (2014)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Bassily, R., Nissim, K., Smith, A., Steinke, T., Stemmer, U., Ullman, J.: Algorithmic stability for adaptive data analysis. arXiv preprint arXiv:1511.02513 (2015)","DOI":"10.1145\/2897518.2897566"},{"issue":"1","key":"10_CR6","first-page":"39","volume":"22","author":"AL Berger","year":"1996","unstructured":"Berger, A.L., Pietra, V.J.D., Pietra, S.A.D.: A maximum entropy approach to natural language processing. Comput. Linguist. 22(1), 39\u201371 (1996)","journal-title":"Comput. Linguist."},{"key":"10_CR7","first-page":"499","volume":"2","author":"O Bousquet","year":"2002","unstructured":"Bousquet, O., Elisseeff, A.: Stability and generalization. J. Mach. Learn. Res. 2, 499\u2013526 (2002)","journal-title":"J. Mach. Learn. Res."},{"key":"10_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-7802-8","volume-title":"Statistical Confidentiality: Principle and Practice","author":"GT Duncan","year":"2011","unstructured":"Duncan, G.T., Elliot, M., Salazar-Gonz\u00e1lez, J.J.: Statistical Confidentiality: Principle and Practice. Springer, New York (2011)"},{"key":"10_CR9","unstructured":"Duncan, G.T., Fienberg, S.E., Krishnan, R., Padman, R., Roehrig, S.F.: Disclosure limitation methods and information loss for tabular data. In: Confidentiality, Disclosure and Data Access: Theory and Practical Applications for Statistical Agencies, pp. 135\u2013166 (2001)"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/11787006_1","volume-title":"Automata, Languages and Programming","author":"C Dwork","year":"2006","unstructured":"Dwork, C.: Differential privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 1\u201312. Springer, Heidelberg (2006)"},{"key":"10_CR11","unstructured":"Dwork, C., Feldman, V., Hardt, M., Pitassi, T., Reingold, O., Roth, A.: Generalization in adaptive data analysis and holdout reuse. In: Advances in Neural Information Processing Systems (NIPS 2015), pp. 2341\u20132349 (2015)"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Dwork, C., Feldman, V., Hardt, M., Pitassi, T., Reingold, O., Roth, A.L.: Preserving statistical validity in adaptive data analysis. In: ACM on Symposium on Theory of Computing (STOC 2015), pp. 117\u2013126. ACM (2015)","DOI":"10.1145\/2746539.2746580"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1007\/11761679_29","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"C Dwork","year":"2006","unstructured":"Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., Naor, M.: Our data, ourselves: privacy via distributed noise generation. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 486\u2013503. Springer, Heidelberg (2006)"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/11681878_14","volume-title":"Theory of Cryptography","author":"C Dwork","year":"2006","unstructured":"Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 265\u2013284. Springer, Heidelberg (2006)"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Ebadi, H., Sands, D., Schneider, G.: Differential privacy: now it\u2019s getting personal. In: ACM Symposium on Principles of Programming Languages, pp. 69\u201381. ACM (2015)","DOI":"10.1145\/2676726.2677005"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/978-3-642-15838-4_17","volume-title":"Privacy in Statistical Databases","author":"SE Fienberg","year":"2010","unstructured":"Fienberg, S.E., Rinaldo, A., Yang, X.: Differential privacy and the risk-utility tradeoff for multi-dimensional contingency tables. In: Domingo-Ferrer, J., Magkos, E. (eds.) PSD 2010. LNCS, vol. 6344, pp. 187\u2013199. Springer, Heidelberg (2010)"},{"key":"10_CR17","unstructured":"Hall, R., Rinaldo, A., Wasserman, L.: Random differential privacy. arXiv preprint arXiv:1112.2680 (2011)"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Hardt, M., Ullman, J.: Preventing false discovery in interactive data analysis is hard. In: IEEE Symposium on Foundations of Computer Science (FOCS 2014), pp. 454\u2013463. IEEE (2014)","DOI":"10.1109\/FOCS.2014.55"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Hundepool, A., Domingo-Ferrer, J., Franconi, L., Giessing, S., Nordholt, E.S., Spicer, K., De Wolf, P.P.: Statistical Disclosure Control. Wiley (2012)","DOI":"10.1002\/9781118348239"},{"issue":"4","key":"10_CR20","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1103\/PhysRev.106.620","volume":"106","author":"ET Jaynes","year":"1957","unstructured":"Jaynes, E.T.: Information theory and statistical mechanics. Phys. Rev. 106(4), 620 (1957)","journal-title":"Phys. Rev."},{"issue":"6","key":"10_CR21","doi-asserted-by":"crossref","first-page":"1427","DOI":"10.1162\/089976699300016304","volume":"11","author":"M Kearns","year":"1999","unstructured":"Kearns, M., Ron, D.: Algorithmic stability and sanity-check bounds for leave-one-out cross-validation. Neural Comput. 11(6), 1427\u20131453 (1999)","journal-title":"Neural Comput."},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Liu, Z., Wang, Y.X., Smola, A.: Fast differentially private matrix factorization. In: ACM Conference on Recommender Systems (RecSys 2015), pp. 171\u2013178. ACM (2015)","DOI":"10.1145\/2792838.2800191"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"McSherry, F., Talwar, K.: Mechanism design via differential privacy. In: IEEE Symposium on Foundations of Computer Science (FOCS 2007), pp. 94\u2013103 (2007)","DOI":"10.1109\/FOCS.2007.66"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/978-3-642-37119-6_25","volume-title":"Foundations and Practice of Security","author":"DJ Mir","year":"2013","unstructured":"Mir, D.J.: Information-theoretic foundations of differential privacy. In: Garcia-Alfaro, J., Cuppens, F., Cuppens-Boulahia, N., Miri, A., Tawbi, N. (eds.) FPS 2012. LNCS, vol. 7743, pp. 374\u2013381. Springer, Heidelberg (2013)"},{"key":"10_CR25","unstructured":"Mosteller, F., Tukey, J.W.: Data analysis, including statistics (1968)"},{"issue":"1\u20133","key":"10_CR26","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10444-004-7634-z","volume":"25","author":"S Mukherjee","year":"2006","unstructured":"Mukherjee, S., Niyogi, P., Poggio, T., Rifkin, R.: Learning theory: stability is sufficient for generalization and necessary and sufficient for consistency of empirical risk minimization. Adv. Comput. Math. 25(1\u20133), 161\u2013193 (2006)","journal-title":"Adv. Comput. Math."},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Narayanan, A., Shmatikov, V.: Robust de-anonymization of large sparse datasets. In: IEEE Symposium on Security and Privacy, pp. 111\u2013125. IEEE, September 2008","DOI":"10.1109\/SP.2008.33"},{"key":"10_CR28","unstructured":"Russo, D., Zou, J.: Controlling bias in adaptive data analysis using information theory. In: International Conference on Artificial Intelligence and Statistics (AISTATS 2016) (2016)"},{"key":"10_CR29","first-page":"2635","volume":"11","author":"S Shalev-Shwartz","year":"2010","unstructured":"Shalev-Shwartz, S., Shamir, O., Srebro, N., Sridharan, K.: Learnability, stability and uniform convergence. J. Mach. Learn. Res. 11, 2635\u20132670 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"10_CR30","unstructured":"Steinke, T., Ullman, J.: Interactive fingerprinting codes and the hardness of preventing false discovery. arXiv preprint arXiv:1410.1228 (2014)"},{"key":"10_CR31","unstructured":"Tishby, N., Pereira, F.C., Bialek, W.: The information bottleneck method. arXiv preprint arXiv:physics\/0004057 (2000)"},{"issue":"1","key":"10_CR32","first-page":"137","volume":"5","author":"C Uhlerop","year":"2013","unstructured":"Uhlerop, C., Slavkovi\u0107, A., Fienberg, S.E.: Privacy-preserving data sharing for genome-wide association studies. J. Priv. Confidentiality 5(1), 137 (2013)","journal-title":"J. Priv. Confidentiality"},{"issue":"7","key":"10_CR33","doi-asserted-by":"crossref","first-page":"3797","DOI":"10.1109\/TIT.2014.2320500","volume":"60","author":"T Erven Van","year":"2014","unstructured":"Van Erven, T., Harremo\u00ebs, P.: R\u00e9nyi divergence and kullback-leibler divergence. IEEE Trans. Inf. Theor. 60(7), 3797\u20133820 (2014)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"10_CR34","unstructured":"Wang, Y.X., Fienberg, S.E., Smola, A.: Privacy for free: posterior sampling and stochastic gradient monte carlo. In: International Conference on Machine Learning (ICML 2015) (2015)"},{"key":"10_CR35","unstructured":"Wang, Y.X., Lei, J., Fienberg, S.E.: Learning with differential privacy: stability, learnability and the sufficiency and necessity of erm principle. J. Mach. Learn. Res. (to appear, 2016)"},{"key":"10_CR36","unstructured":"Wang, Y.X., Lei, J., Fienberg, S.E.: On-average kl-privacy and its equivalence to generalization for max-entropy mechanisms (2016). preprint http:\/\/www.cs.cmu.edu\/~yuxiangw\/publications.html"},{"key":"10_CR37","unstructured":"Yau, N.: Lessons from improperly anonymized taxi logs (2014). http:\/\/flowingdata.com\/2014\/06\/23\/lessons-from-improperly-anonymized-taxi-logs\/"},{"key":"10_CR38","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.jbi.2014.01.008","volume":"50","author":"F Yu","year":"2014","unstructured":"Yu, F., Fienberg, S.E., Slavkovi\u0107, A.B., Uhler, C.: Scalable privacy-preserving data sharing methodology for genome-wide association studies. J. Biomed. Inform. 50, 133\u2013141 (2014)","journal-title":"J. Biomed. Inform."},{"issue":"2","key":"10_CR39","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1109\/TIT.2008.2009605","volume":"55","author":"S Zhou","year":"2009","unstructured":"Zhou, S., Lafferty, J., Wasserman, L.: Compressed and privacy-sensitive sparse regression. IEEE Trans. Inf. Theor. 55(2), 846\u2013866 (2009)","journal-title":"IEEE Trans. Inf. Theor."}],"container-title":["Lecture Notes in Computer Science","Privacy in Statistical Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45381-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T22:04:58Z","timestamp":1568325898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45381-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319453804","9783319453811"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45381-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}