{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T03:02:19Z","timestamp":1790823739780,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,5,9]],"date-time":"2017-05-09T00:00:00Z","timestamp":1494288000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["1253942"],"award-info":[{"award-number":["1253942"]}],"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":[[2017,5,9]]},"DOI":"10.1145\/3035918.3064047","type":"proceedings-article","created":{"date-parts":[[2017,5,10]],"date-time":"2017-05-10T18:09:00Z","timestamp":1494439740000},"page":"1307-1322","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":99,"title":["Bolt-on Differential Privacy for Scalable Stochastic Gradient Descent-based Analytics"],"prefix":"10.1145","author":[{"given":"Xi","family":"Wu","sequence":"first","affiliation":[{"name":"Google & University of Wisconsin-Madison, Madison, WI, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fengan","family":"Li","sequence":"additional","affiliation":[{"name":"Google & University of Wisconsin-Madison, Madison, WI, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arun","family":"Kumar","sequence":"additional","affiliation":[{"name":"University of California, San Diego, San Diego, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kamalika","family":"Chaudhuri","sequence":"additional","affiliation":[{"name":"University of California, San Diego, San Diego, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Somesh","family":"Jha","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, Madison, WI, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jeffrey","family":"Naughton","sequence":"additional","affiliation":[{"name":"Google & University of Wisconsin-Madison, Madison, WI, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,5,9]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Apache Mahout. mahout.apache.org.  Apache Mahout. mahout.apache.org."},{"key":"e_1_3_2_1_2_1","unstructured":"Apache Spark. https:\/\/en.wikipedia.org\/wiki\/Apache_Spark.  Apache Spark. https:\/\/en.wikipedia.org\/wiki\/Apache_Spark."},{"key":"e_1_3_2_1_3_1","unstructured":"Grid Search. http:\/\/scikit-learn.org\/stable\/modules\/grid_search.html.  Grid Search. http:\/\/scikit-learn.org\/stable\/modules\/grid_search.html."},{"key":"e_1_3_2_1_4_1","unstructured":"Hinge Loss and Smoothed Variants. https:\/\/en.wikipedia.org\/wiki\/Hinge_loss.  Hinge Loss and Smoothed Variants. https:\/\/en.wikipedia.org\/wiki\/Hinge_loss."},{"key":"e_1_3_2_1_5_1","unstructured":"How many secrets do you have? https:\/\/github.com\/frankmcsherry\/blog\/blob\/master\/posts\/2017-02-08.md.  How many secrets do you have? https:\/\/github.com\/frankmcsherry\/blog\/blob\/master\/posts\/2017-02-08.md."},{"key":"e_1_3_2_1_6_1","unstructured":"Preprocessing data in machine learning. http:\/\/scikit-learn.org\/stable\/modules\/preprocessing.html.  Preprocessing data in machine learning. http:\/\/scikit-learn.org\/stable\/modules\/preprocessing.html."},{"key":"e_1_3_2_1_7_1","unstructured":"Random Projection. https:\/\/en.wikipedia.org\/wiki\/Random_projection.  Random Projection. https:\/\/en.wikipedia.org\/wiki\/Random_projection."},{"key":"e_1_3_2_1_8_1","unstructured":"random unit vector in multi-dimensional space. http:\/\/stackoverflow.com\/questions\/6283080\/random-unit-vector-in-multi-dimensional-space.  random unit vector in multi-dimensional space. http:\/\/stackoverflow.com\/questions\/6283080\/random-unit-vector-in-multi-dimensional-space."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978318"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.56"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/993483"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000050"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2021036"},{"key":"e_1_3_2_1_14_1","volume-title":"NIPS","author":"Chaudhuri K.","year":"2013","unstructured":"K. Chaudhuri and S. A. Vinterbo . A stability-based validation procedure for differentially private machine learning . In NIPS , 2013 . K. Chaudhuri and S. A. Vinterbo. A stability-based validation procedure for differentially private machine learning. In NIPS, 2013."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.53"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000042"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660348"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213874"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009726021843"},{"key":"e_1_3_2_1_21_1","volume-title":"Sept.","author":"Hardt M.","year":"2015","unstructured":"M. Hardt , B. Recht , and Y. Singer . Train faster, generalize better: Stability of stochastic gradient descent. ArXiv e-prints , Sept. 2015 . M. Hardt, B. Recht, and Y. Singer. Train faster, generalize better: Stability of stochastic gradient descent. ArXiv e-prints, Sept. 2015."},{"key":"e_1_3_2_1_22_1","volume-title":"Principled evaluation of differentially private algorithms using dpbench. CoRR, abs\/1512.04817","author":"Hay M.","year":"2015","unstructured":"M. Hay , A. Machanavajjhala , G. Miklau , Y. Chen , and D. Zhang . Principled evaluation of differentially private algorithms using dpbench. CoRR, abs\/1512.04817 , 2015 . M. Hay, A. Machanavajjhala, G. Miklau, Y. Chen, and D. Zhang. Principled evaluation of differentially private algorithms using dpbench. CoRR, abs\/1512.04817, 2015."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367510"},{"key":"e_1_3_2_1_24_1","volume-title":"COLT","author":"Jain P.","year":"2012","unstructured":"P. Jain , P. Kothari , and A. Thakurta . Differentially private online learning . In COLT , 2012 . P. Jain, P. Kothari, and A. Thakurta. Differentially private online learning. In COLT, 2012."},{"key":"e_1_3_2_1_25_1","volume-title":"ICML","author":"Jain P.","year":"2013","unstructured":"P. Jain and A. Thakurta . Differentially private learning with kernels . In ICML , 2013 . P. Jain and A. Thakurta. Differentially private learning with kernels. In ICML, 2013."},{"key":"e_1_3_2_1_26_1","volume-title":"NIPS","author":"Johnson R.","year":"2013","unstructured":"R. Johnson and T. Zhang . Accelerating stochastic gradient descent using predictive variance reduction . In NIPS , 2013 . R. Johnson and T. Zhang. Accelerating stochastic gradient descent using predictive variance reduction. In NIPS, 2013."},{"key":"e_1_3_2_1_27_1","volume-title":"COLT","author":"Kifer D.","year":"2012","unstructured":"D. Kifer , A. D. Smith , and A. Thakurta . Private convex optimization for empirical risk minimization with applications to high-dimensional regression . In COLT , 2012 . D. Kifer, A. D. Smith, and A. Thakurta. Private convex optimization for empirical risk minimization with applications to high-dimensional regression. In COLT, 2012."},{"key":"e_1_3_2_1_28_1","volume-title":"Problem complexity and method efficiency in optimization","author":"Nemirovsky A.","year":"1983","unstructured":"A. Nemirovsky and D. Yudin . Problem complexity and method efficiency in optimization . 1983 . A. Nemirovsky and D. Yudin. Problem complexity and method efficiency in optimization. 1983."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/2670022"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1561\/2400000003"},{"key":"e_1_3_2_1_31_1","volume-title":"Optimization Software","author":"Polyak B. T.","year":"1987","unstructured":"B. T. Polyak . Introduction to optimization . Optimization Software , 1987 . B. T. Polyak. Introduction to optimization. Optimization Software, 1987."},{"key":"e_1_3_2_1_32_1","volume-title":"NIPS","author":"Roux N. L.","year":"2012","unstructured":"N. L. Roux , M. W. Schmidt , and F. R. Bach . A stochastic gradient method with an exponential convergence rate for finite training sets . In NIPS , 2012 . N. L. Roux, M. W. Schmidt, and F. R. Bach. A stochastic gradient method with an exponential convergence rate for finite training sets. In NIPS, 2012."},{"key":"e_1_3_2_1_33_1","volume-title":"Learning in a large function space: Privacy-preserving mechanisms for SVM learning. CoRR, abs\/0911.5708","author":"Rubinstein B. I. P.","year":"2009","unstructured":"B. I. P. Rubinstein , P. L. Bartlett , L. Huang , and N. Taft . Learning in a large function space: Privacy-preserving mechanisms for SVM learning. CoRR, abs\/0911.5708 , 2009 . B. I. P. Rubinstein, P. L. Bartlett, L. Huang, and N. Taft. Learning in a large function space: Privacy-preserving mechanisms for SVM learning. CoRR, abs\/0911.5708, 2009."},{"key":"e_1_3_2_1_34_1","volume-title":"Mar.","author":"Shamir O.","year":"2016","unstructured":"O. Shamir . Without-Replacement Sampling for Stochastic Gradient Methods : Convergence Results and Application to Distributed Optimization. ArXiv e-prints , Mar. 2016 . O. Shamir. Without-Replacement Sampling for Stochastic Gradient Methods: Convergence Results and Application to Distributed Optimization. ArXiv e-prints, Mar. 2016."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2013.6736861"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465330"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350253"},{"key":"e_1_3_2_1_38_1","volume-title":"ICML","author":"Zinkevich M.","year":"2003","unstructured":"M. Zinkevich . Online convex programming and generalized infinitesimal gradient ascent . In ICML , 2003 . M. Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. In ICML, 2003."}],"event":{"name":"SIGMOD\/PODS'17: International Conference on Management of Data","location":"Chicago Illinois USA","acronym":"SIGMOD\/PODS'17","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2017 ACM International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3035918.3064047","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3035918.3064047","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3035918.3064047","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:42Z","timestamp":1750217802000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3035918.3064047"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,9]]},"references-count":38,"alternative-id":["10.1145\/3035918.3064047","10.1145\/3035918"],"URL":"https:\/\/doi.org\/10.1145\/3035918.3064047","relation":{},"subject":[],"published":{"date-parts":[[2017,5,9]]},"assertion":[{"value":"2017-05-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}