{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,28]],"date-time":"2026-10-28T16:41:55Z","timestamp":1793205715525,"version":"4.5.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T00:00:00Z","timestamp":1561248000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1815328"],"award-info":[{"award-number":["CCF-1815328"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,23]]},"DOI":"10.1145\/3313276.3316377","type":"proceedings-article","created":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T08:19:08Z","timestamp":1561018748000},"page":"298-309","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":37,"title":["Private selection from private candidates"],"prefix":"10.1145","author":[{"given":"Jingcheng","family":"Liu","sequence":"first","affiliation":[{"name":"University of California at Berkeley, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kunal","family":"Talwar","sequence":"additional","affiliation":[{"name":"Google Brain, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,6,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978318"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897566"},{"key":"e_1_3_2_1_3_1","first-page":"378","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"Beimel A.","year":"2013","unstructured":"A. Beimel , K. Nissim , and U. Stemmer . Private learning and sanitization: Pure vs. approximate differential privacy . In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques , pages 363\u2013 378 , Berlin, Heidelberg , 2013 . Springer Berlin Heidelberg . A. Beimel, K. Nissim, and U. Stemmer. Private learning and sanitization: Pure vs. approximate differential privacy. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pages 363\u2013378, Berlin, Heidelberg, 2013. Springer Berlin Heidelberg."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835869"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.45"},{"key":"e_1_3_2_1_6_1","first-page":"1295","volume-title":"Proceedings of the 27th International Conference on Neural Information Processing Systems -","volume":"1","author":"Chaudhuri K.","year":"2014","unstructured":"K. Chaudhuri , D. Hsu , and S. Song . The large margin mechanism for differentially private maximization . In Proceedings of the 27th International Conference on Neural Information Processing Systems - Volume 1 , NIPS\u201914, pages 1287\u2013 1295 , Cambridge, MA, USA , 2014 . MIT Press. K. Chaudhuri, D. Hsu, and S. Song. The large margin mechanism for differentially private maximization. In Proceedings of the 27th International Conference on Neural Information Processing Systems - Volume 1, NIPS\u201914, pages 1287\u20131295, Cambridge, MA, USA, 2014. MIT Press."},{"key":"e_1_3_2_1_7_1","first-page":"997","volume-title":"Advances in Neural Information Processing Systems","author":"Chaudhuri K.","year":"2012","unstructured":"K. Chaudhuri , A. Sarwate , and K. Sinha . Near-optimal differentially private principal components . In Advances in Neural Information Processing Systems , pages 989\u2013 997 , 2012 . K. Chaudhuri, A. Sarwate, and K. Sinha. Near-optimal differentially private principal components. In Advances in Neural Information Processing Systems, pages 989\u2013997, 2012."},{"key":"e_1_3_2_1_8_1","first-page":"2660","volume-title":"Advances in Neural Information Processing Systems","author":"Chaudhuri K.","year":"2013","unstructured":"K. Chaudhuri and S. A. Vinterbo . A stability-based validation procedure for differentially private machine learning . In Advances in Neural Information Processing Systems , pages 2652\u2013 2660 , 2013 . K. Chaudhuri and S. A. Vinterbo. A stability-based validation procedure for differentially private machine learning. In Advances in Neural Information Processing Systems, pages 2652\u20132660, 2013."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746580"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536466"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536467"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000042"},{"key":"e_1_3_2_1_14_1","volume-title":"Private false discovery rate control. arXiv preprint arXiv:1511.03803","author":"Dwork C.","year":"2015","unstructured":"C. Dwork , W. Su , and L. Zhang . Private false discovery rate control. arXiv preprint arXiv:1511.03803 , 2015 . C. Dwork, W. Su, and L. Zhang. Private false discovery rate control. arXiv preprint arXiv:1511.03803, 2015."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/3327345.3327407"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1511\/2014.111.460"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873691"},{"key":"e_1_3_2_1_18_1","volume-title":"Personal Communication","author":"Gupta A.","year":"2011","unstructured":"A. Gupta , F. McSherry , and K. Talwar . Personal Communication , 2011 . A. Gupta, F. McSherry, and K. Talwar. Personal Communication, 2011."},{"key":"e_1_3_2_1_19_1","first-page":"1414","volume-title":"Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms","author":"Kapralov M.","unstructured":"M. Kapralov and K. Talwar . On differentially private low rank approximation . In Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms , pages 1395\u2013 1414 . SIAM, 2013. M. Kapralov and K. Talwar. On differentially private low rank approximation. In Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms, pages 1395\u20131414. SIAM, 2013."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.27"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035945"},{"key":"e_1_3_2_1_22_1","first-page":"927","volume-title":"Proceedings of the 32nd International Conference on Machine Learning","author":"Kusner M.","year":"2015","unstructured":"M. Kusner , J. Gardner , R. Garnett , and K. Weinberger . Differentially private bayesian optimization . In Proceedings of the 32nd International Conference on Machine Learning , pages 918\u2013 927 , 2015 . M. Kusner, J. Gardner, R. Garnett, and K. Weinberger. Differentially private bayesian optimization. In Proceedings of the 32nd International Conference on Machine Learning, pages 918\u2013927, 2015."},{"key":"e_1_3_2_1_23_1","first-page":"07","article-title":"Differentially private model selection with penalized and constrained likelihood. Journal of the Royal Statistical Society: Series A (Statistics","author":"Lei J.","year":"2016","unstructured":"J. Lei , A.-S. Charest , A. Slavkovic , A. Smith , and S. Fienberg . Differentially private model selection with penalized and constrained likelihood. Journal of the Royal Statistical Society: Series A (Statistics in Society) , 07 2016 . J. Lei, A.-S. Charest, A. Slavkovic, A. Smith, and S. Fienberg. Differentially private model selection with penalized and constrained likelihood. Journal of the Royal Statistical Society: Series A (Statistics in Society), 07 2016.","journal-title":"Society)"},{"key":"e_1_3_2_1_24_1","volume-title":"ICLR","author":"Li L.","year":"2017","unstructured":"L. Li , K. Jamieson , G. DeSalvo , A. Rostamizadeh , and A. Talwalkar . Hyperband: Bandit-based configuration evaluation for hyperparameter optimization . In ICLR , 2017 . L. Li, K. Jamieson, G. DeSalvo, A. Rostamizadeh, and A. Talwalkar. Hyperband: Bandit-based configuration evaluation for hyperparameter optimization. In ICLR, 2017."},{"key":"e_1_3_2_1_25_1","first-page":"2576","volume-title":"Advances in Neural Information Processing Systems","author":"Ligett K.","year":"2017","unstructured":"K. Ligett , S. Neel , A. Roth , B. Waggoner , and S. Z. Wu . Accuracy first: Selecting a differential privacy level for accuracy constrained erm . In Advances in Neural Information Processing Systems , pages 2566\u2013 2576 , 2017 . K. Ligett, S. Neel, A. Roth, B. Waggoner, and S. Z. Wu. Accuracy first: Selecting a differential privacy level for accuracy constrained erm. In Advances in Neural Information Processing Systems, pages 2566\u20132576, 2017."},{"key":"e_1_3_2_1_26_1","volume-title":"Nov.","author":"Liu J.","year":"2018","unstructured":"J. Liu and K. Talwar . Private selection from private candidates. arXiv preprint arXiv:1811.07971 , Nov. 2018 . J. Liu and K. Talwar. Private selection from private candidates. arXiv preprint arXiv:1811.07971, Nov. 2018."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.41"},{"key":"e_1_3_2_1_28_1","first-page":"972","volume-title":"Proceedings of the 30th International Conference on Neural Information Processing Systems, NIPS\u201916","author":"Minami K.","year":"2016","unstructured":"K. Minami , H. Arai , I. Sato , and H. Nakagawa . Differential privacy without sensitivity . In Proceedings of the 30th International Conference on Neural Information Processing Systems, NIPS\u201916 , pages 964\u2013 972 , USA, 2016 . Curran Associates Inc. K. Minami, H. Arai, I. Sato, and H. Nakagawa. Differential privacy without sensitivity. In Proceedings of the 30th International Conference on Neural Information Processing Systems, NIPS\u201916, pages 964\u2013972, USA, 2016. Curran Associates Inc."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250803"},{"key":"e_1_3_2_1_31_1","volume-title":"Semisupervised knowledge transfer for deep learning from private training data. arXiv preprint arXiv:1610.05755","author":"Papernot N.","year":"2016","unstructured":"N. Papernot , M. Abadi , U. Erlingsson , I. Goodfellow , and K. Talwar . Semisupervised knowledge transfer for deep learning from private training data. arXiv preprint arXiv:1610.05755 , 2016 . N. Papernot, M. Abadi, U. Erlingsson, I. Goodfellow, and K. Talwar. Semisupervised knowledge transfer for deep learning from private training data. arXiv preprint arXiv:1610.05755, 2016."},{"key":"e_1_3_2_1_32_1","first-page":"504","volume-title":"Foundations of Computer Science (FOCS), 2016 IEEE 57th Annual Symposium on","author":"Raskhodnikova S.","unstructured":"S. Raskhodnikova and A. Smith . Lipschitz extensions for node-private graph statistics and the generalized exponential mechanism . In Foundations of Computer Science (FOCS), 2016 IEEE 57th Annual Symposium on , pages 495\u2013 504 . IEEE, 2016. S. Raskhodnikova and A. Smith. Lipschitz extensions for node-private graph statistics and the generalized exponential mechanism. In Foundations of Computer Science (FOCS), 2016 IEEE 57th Annual Symposium on, pages 495\u2013504. IEEE, 2016."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993743"},{"key":"e_1_3_2_1_34_1","first-page":"850","volume-title":"Proceedings of the 26th Annual Conference on Learning Theory","author":"Smith A.","year":"2013","unstructured":"A. Smith and A. Thakurta . Differentially private feature selection via stability arguments, and the robustness of the lasso . In Proceedings of the 26th Annual Conference on Learning Theory , pages 819\u2013 850 , 2013 . A. Smith and A. Thakurta. Differentially private feature selection via stability arguments, and the robustness of the lasso. In Proceedings of the 26th Annual Conference on Learning Theory, pages 819\u2013850, 2013."},{"key":"e_1_3_2_1_35_1","volume-title":"Privacy-preserving data sharing for genome-wide association studies. The Journal of privacy and confidentiality, 5(1):137","author":"Uhlerop C.","year":"2013","unstructured":"C. Uhlerop , A. Slavkovi\u0107 , and S. E. Fienberg . Privacy-preserving data sharing for genome-wide association studies. The Journal of privacy and confidentiality, 5(1):137 , 2013 . C. Uhlerop, A. Slavkovi\u0107, and S. E. Fienberg. Privacy-preserving data sharing for genome-wide association studies. The Journal of privacy and confidentiality, 5(1):137, 2013."}],"event":{"name":"STOC '19: 51st Annual ACM SIGACT Symposium on the Theory of Computing","location":"Phoenix AZ USA","acronym":"STOC '19","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313276.3316377","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3313276.3316377","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3313276.3316377","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:54:32Z","timestamp":1750190072000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313276.3316377"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,23]]},"references-count":34,"alternative-id":["10.1145\/3313276.3316377","10.1145\/3313276"],"URL":"https:\/\/doi.org\/10.1145\/3313276.3316377","relation":{},"subject":[],"published":{"date-parts":[[2019,6,23]]},"assertion":[{"value":"2019-06-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}