{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T22:44:49Z","timestamp":1779403489163,"version":"3.53.1"},"reference-count":53,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2014,12,17]],"date-time":"2014-12-17T00:00:00Z","timestamp":1418774400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100006754","name":"U.S. Army Research Laboratory","doi-asserted-by":"publisher","award":["W911NF-11-1-0391"],"award-info":[{"award-number":["W911NF-11-1-0391"]}],"id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[2014,12,17]]},"abstract":"<jats:p>We study statistical risk minimization problems under a privacy model in which the data is kept confidential even from the learner. In this local privacy framework, we establish sharp upper and lower bounds on the convergence rates of statistical estimation procedures. As a consequence, we exhibit a precise tradeoff between the amount of privacy the data preserves and the utility, as measured by convergence rate, of any statistical estimator or learning procedure.<\/jats:p>","DOI":"10.1145\/2666468","type":"journal-article","created":{"date-parts":[[2014,12,19]],"date-time":"2014-12-19T13:38:51Z","timestamp":1418996331000},"page":"1-57","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":92,"title":["Privacy Aware Learning"],"prefix":"10.1145","volume":"61","author":[{"given":"John C.","family":"Duchi","sequence":"first","affiliation":[{"name":"University of California, Berkeley, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael I.","family":"Jordan","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin J.","family":"Wainwright","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2014,12,17]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2182178"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(02)00231-6"},{"key":"e_1_2_1_3_1","unstructured":"D. P. Bertsekas and J. N. Tsitsiklis. 1989. Parallel and Distributed Computation: Numerical Methods. Prentice-Hall Inc. D. P. Bertsekas and J. N. Tsitsiklis. 1989. Parallel and Distributed Computation: Numerical Methods. Prentice-Hall Inc."},{"key":"e_1_2_1_4_1","volume-title":"Probability and Measure","author":"Billingsley P.","unstructured":"P. Billingsley . 1986. Probability and Measure , 2 nd Ed. Wiley . P. Billingsley. 1986. Probability and Measure, 2nd Ed. Wiley.","edition":"2"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374464"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"S. Boyd and L. Vandenberghe. 2004. Convex Optimization. Cambridge University Press. S. Boyd and L. Vandenberghe. 2004. Convex Optimization. Cambridge University Press.","DOI":"10.1017\/CBO9780511804441"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2021036"},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","unstructured":"T. M. Cover and J. A. Thomas. 2006. Elements of information theory 2nd Ed. Wiley. T. M. Cover and J. A. Thomas. 2006. Elements of information theory 2nd Ed. Wiley.","DOI":"10.1002\/047174882X"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1751-5823.2011.00140.x"},{"key":"e_1_2_1_10_1","volume-title":"Information Theory: Coding Theorems for Discrete Memoryless Systems","author":"Csisz'ar I.","year":"1981","unstructured":"I. Csisz'ar and J. K\u00f6rner . 1981 . Information Theory: Coding Theorems for Discrete Memoryless Systems . Academic Press . I. Csisz'ar and J. K\u00f6rner. 1981. Information Theory: Coding Theorems for Discrete Memoryless Systems. Academic Press."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773173"},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","unstructured":"J. C. Duchi M. I. Jordan and M. J. Wainwright. 2013. Local privacy and statistical minimax rates. arXiv:1302.3203 {math.ST}. J. C. Duchi M. I. Jordan and M. J. Wainwright. 2013. Local privacy and statistical minimax rates. arXiv:1302.3203 {math.ST}.","DOI":"10.1109\/FOCS.2013.53"},{"key":"e_1_2_1_13_1","article-title":"Disclosure-limited data dissemination","volume":"81","author":"Duncan G. T.","year":"1986","unstructured":"G. T. Duncan and D. Lambert . 1986 . Disclosure-limited data dissemination . J. Amer. Stat. Assoc. 81 , 393, 10--18. G. T. Duncan and D. Lambert. 1986. Disclosure-limited data dissemination. J. Amer. Stat. Assoc. 81, 393, 10--18.","journal-title":"J. Amer. Stat. Assoc."},{"key":"e_1_2_1_14_1","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1080\/07350015.1989.10509729","article-title":"The risk of disclosure for microdata","volume":"7","author":"Duncan G. T.","year":"1989","unstructured":"G. T. Duncan and D. Lambert . 1989 . The risk of disclosure for microdata . J. Busin. Economic Statistics 7 , 2, 207 -- 217 . G. T. Duncan and D. Lambert. 1989. The risk of disclosure for microdata. J. Busin. Economic Statistics 7, 2, 207--217.","journal-title":"J. Busin. Economic Statistics"},{"key":"e_1_2_1_15_1","series-title":"Lecture Notes in Computer Science Series","volume-title":"Theory and Applications of Models of Computation","author":"Dwork C.","unstructured":"C. Dwork . 2008. Differential privacy: A survey of results . In Theory and Applications of Models of Computation , Lecture Notes in Computer Science Series , vol. 4978 , Springer , 1--19. C. Dwork. 2008. Differential privacy: A survey of results. In Theory and Applications of Models of Computation, Lecture Notes in Computer Science Series, vol. 4978, Springer, 1--19."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536466"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.12"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/773153.773174"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1972.10481199"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401926"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536464"},{"key":"e_1_2_1_23_1","volume-title":"Entropy and information theory","author":"Gray R. M.","unstructured":"R. M. Gray . 1990. Entropy and information theory . Springer . R. M. Gray. 1990. Entropy and information theory. Springer."},{"key":"e_1_2_1_24_1","unstructured":"R. Hall A. Rinaldo and L. Wasserman. 2011. Random differential privacy. arXiv:1112.2680 {stat.ME}. R. Hall A. Rinaldo and L. Wasserman. 2011. Random differential privacy. arXiv:1112.2680 {stat.ME}."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806786"},{"key":"e_1_2_1_26_1","unstructured":"J. Hiriart-Urruty and C. Lemar\u00e9chal. 1996. Convex Analysis and Minimization Algorithms I & II. Springer New York. J. Hiriart-Urruty and C. Lemar\u00e9chal. 1996. Convex Analysis and Minimization Algorithms I & II. Springer New York."},{"key":"e_1_2_1_27_1","volume-title":"Foundations of Modern Probability","author":"Kallenberg O.","unstructured":"O. Kallenberg . 1997. Foundations of Modern Probability . Springer . O. Kallenberg. 1997. Foundations of Modern Probability. Springer."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1198\/000313006X124640"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/090756090"},{"key":"e_1_2_1_30_1","volume-title":"Proceedings of the 45th Annual ACM Symposium on the Theory of Computing.","author":"Kasiviswanathan S. P.","unstructured":"S. P. Kasiviswanathan , M. Rudelson , and A. Smith . 2013. The power of linear reconstruction attacks . In Proceedings of the 45th Annual ACM Symposium on the Theory of Computing. S. P. Kasiviswanathan, M. Rudelson, and A. Smith. 2013. The power of linear reconstruction attacks. In Proceedings of the 45th Annual ACM Symposium on the Theory of Computing."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293351"},{"key":"e_1_2_1_32_1","volume-title":"Proceedings of the 3rd Berkeley Symposium on Mathematical Statistics and Probability, 129--156","author":"Cam L. Le","year":"1956","unstructured":"L. Le Cam . 1956 . On the asymptotic theory of estimation and hypothesis testing . In Proceedings of the 3rd Berkeley Symposium on Mathematical Statistics and Probability, 129--156 . L. Le Cam. 1956. On the asymptotic theory of estimation and hypothesis testing. In Proceedings of the 3rd Berkeley Symposium on Mathematical Statistics and Probability, 129--156."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1193342380"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1561\/0100000036"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(79)90014-4"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1137\/070704277"},{"key":"e_1_2_1_37_1","unstructured":"A. Nemirovski and D. Yudin. 1983. Problem Complexity and Method Efficiency in Optimization. Wiley. A. Nemirovski and D. Yudin. 1983. Problem Complexity and Method Efficiency in Optimization. Wiley."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488652"},{"key":"e_1_2_1_39_1","volume-title":"Lectures on Choquet's Theorem","author":"Phelps R. R.","unstructured":"R. R. Phelps . 2001. Lectures on Choquet's Theorem , 2 nd Ed. Springer . R. R. Phelps. 2001. Lectures on Choquet's Theorem, 2nd Ed. Springer.","edition":"2"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/0330046"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1198\/016214505000000619"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.29012\/jpc.v4i1.612"},{"key":"e_1_2_1_43_1","volume-title":"Proceedings of the 48th Allerton Conference on Communication, Control, and Computing. 1220--1227","author":"Sankar L.","unstructured":"L. Sankar , S. R. Rajagopalan , and H. V. Poor . 2010. An information-theoretic approach to privacy . In Proceedings of the 48th Allerton Conference on Communication, Control, and Computing. 1220--1227 . L. Sankar, S. R. Rajagopalan, and H. V. Poor. 2010. An information-theoretic approach to privacy. In Proceedings of the 48th Allerton Conference on Communication, Control, and Computing. 1220--1227."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993743"},{"key":"e_1_2_1_45_1","series-title":"Cambridge Series in Statistical and Probabilistic Mathematics","volume-title":"Asymptotic Statistics","author":"Van Der Vaart A. W.","unstructured":"A. W. Van Der Vaart . 1998. Asymptotic Statistics . Cambridge Series in Statistical and Probabilistic Mathematics , Cambridge University Press . A. W. Van Der Vaart. 1998. Asymptotic Statistics. Cambridge Series in Statistical and Probabilistic Mathematics, Cambridge University Press."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177732144"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1965.10480775"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1198\/jasa.2009.tm08651"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1017939142"},{"key":"e_1_2_1_50_1","volume-title":"Festschrift for Lucien Le Cam","author":"Assouad B. Yu.","unstructured":"B. Yu. 1997. Assouad , Fano, and Le Cam . In Festschrift for Lucien Le Cam . Springer-Verlag , 423--435. B. Yu. 1997. Assouad, Fano, and Le Cam. In Festschrift for Lucien Le Cam. Springer-Verlag, 423--435."},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2009605"},{"key":"e_1_2_1_52_1","volume-title":"Proceedings of the IEEE International Symposium on Information Theory.","author":"Zhou S.","unstructured":"S. Zhou , K. Ligett , and L. Wasserman . 2009b. Differential privacy with compression . In Proceedings of the IEEE International Symposium on Information Theory. S. Zhou, K. Ligett, and L. Wasserman. 2009b. Differential privacy with compression. In Proceedings of the IEEE International Symposium on Information Theory."},{"key":"e_1_2_1_53_1","volume-title":"Proceedings of the 20th International Conference on Machine Learning.","author":"Zinkevich M.","year":"2003","unstructured":"M. Zinkevich . 2003 . Online convex programming and generalized infinitesimal gradient ascent . In Proceedings of the 20th International Conference on Machine Learning. M. Zinkevich. 2003. Online convex programming and generalized infinitesimal gradient ascent. In Proceedings of the 20th International Conference on Machine Learning."}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2666468","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2666468","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:29Z","timestamp":1750230089000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2666468"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,17]]},"references-count":53,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2014,12,17]]}},"alternative-id":["10.1145\/2666468"],"URL":"https:\/\/doi.org\/10.1145\/2666468","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"value":"0004-5411","type":"print"},{"value":"1557-735X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,17]]},"assertion":[{"value":"2012-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-12-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}