{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:12:22Z","timestamp":1750219942087,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":64,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T00:00:00Z","timestamp":1665964800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"the Beijing Outstanding Young Scientist Program","award":["BJJWZYJH012019100020098"],"award-info":[{"award-number":["BJJWZYJH012019100020098"]}]},{"name":"Beijing Natural Science Foundation","award":["4222029"],"award-info":[{"award-number":["4222029"]}]},{"DOI":"10.13039\/501100003816","name":"HUAWEI","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003816","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Excellent Talents Program of Institute of Information Engineering, Chinese Academy of Sciences"},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62076234, 62106257"],"award-info":[{"award-number":["62076234, 62106257"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002367","name":"the Special Research Assistant Project of Chinese Academy of Sciences","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002367","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100015803","name":"Tencent","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100015803","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,10,17]]},"DOI":"10.1145\/3511808.3557451","type":"proceedings-article","created":{"date-parts":[[2022,10,16]],"date-time":"2022-10-16T01:22:22Z","timestamp":1665883342000},"page":"951-961","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Sharper Utility Bounds for Differentially Private Models"],"prefix":"10.1145","author":[{"given":"Yilin","family":"Kang","sequence":"first","affiliation":[{"name":"Institute of Information Engineering, Chinese Academy of Sciences & School of Cyber Security, University of Chinese Academy of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Liu","sequence":"additional","affiliation":[{"name":"Renmin University of China, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Li","sequence":"additional","affiliation":[{"name":"Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiping","family":"Wang","sequence":"additional","affiliation":[{"name":"Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,10,17]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978318"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978355"},{"key":"e_1_3_2_2_3_1","volume-title":"Statistical guarantees for the EM algorithm: From population to sample-based analysis. The Annals of Statistics","author":"Balakrishnan Sivaraman","year":"2017","unstructured":"Sivaraman Balakrishnan , Martin J. Wainwright , and Bin Yu. 2017. Statistical guarantees for the EM algorithm: From population to sample-based analysis. The Annals of Statistics ( 2017 ), 77--120. Sivaraman Balakrishnan, Martin J. Wainwright, and Bin Yu. 2017. Statistical guarantees for the EM algorithm: From population to sample-based analysis. The Annals of Statistics (2017), 77--120."},{"key":"e_1_3_2_2_4_1","volume-title":"15th Annual Conference on Computational Learning Theory, COLT 2002. 44--58","author":"Bartlett Peter L.","year":"2002","unstructured":"Peter L. Bartlett , Olivier Bousquet , and Shahar Mendelson . 2002 . Localized Rademacher Complexities. In Computational Learning Theory , 15th Annual Conference on Computational Learning Theory, COLT 2002. 44--58 . Peter L. Bartlett, Olivier Bousquet, and Shahar Mendelson. 2002. Localized Rademacher Complexities. In Computational Learning Theory, 15th Annual Conference on Computational Learning Theory, COLT 2002. 44--58."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Peter L Bartlett Michael I Jordan and Jon D McAuliffe. 2006. Convexity classification and risk bounds. J. Amer. Statist. Assoc. (2006) 138--156.  Peter L Bartlett Michael I Jordan and Jon D McAuliffe. 2006. Convexity classification and risk bounds. J. Amer. Statist. Assoc. (2006) 138--156.","DOI":"10.1198\/016214505000000907"},{"key":"e_1_3_2_2_6_1","unstructured":"Raef Bassily Vitaly Feldman Crist\u00f3bal Guzm\u00e1n and Kunal Talwar. 2020. Stability of Stochastic Gradient Descent on Nonsmooth Convex Losses. In Advances in Neural Information Processing Systems. 4381--4391.  Raef Bassily Vitaly Feldman Crist\u00f3bal Guzm\u00e1n and Kunal Talwar. 2020. Stability of Stochastic Gradient Descent on Nonsmooth Convex Losses. In Advances in Neural Information Processing Systems. 4381--4391."},{"key":"e_1_3_2_2_7_1","unstructured":"Raef Bassily Vitaly Feldman Kunal Talwar and Abhradeep Guha Thakurta. 2019. Private Stochastic Convex Optimization with Optimal Rates. In Advances in Neural Information Processing Systems. 11279--11288.  Raef Bassily Vitaly Feldman Kunal Talwar and Abhradeep Guha Thakurta. 2019. Private Stochastic Convex Optimization with Optimal Rates. In Advances in Neural Information Processing Systems. 11279--11288."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.56"},{"key":"e_1_3_2_2_9_1","unstructured":"Garrett Bernstein and Daniel R Sheldon. 2019. Differentially Private Bayesian Linear Regression. In Advances in Neural Information Processing Systems. 523--533.  Garrett Bernstein and Daniel R Sheldon. 2019. Differentially Private Bayesian Linear Regression. In Advances in Neural Information Processing Systems. 523--533."},{"key":"e_1_3_2_2_10_1","unstructured":"Gianluca Bontempi and Worldline. 2018. ULB The Machine Learning Group.  Gianluca Bontempi and Worldline. 2018. ULB The Machine Learning Group."},{"volume-title":"Concentration inequalities: A nonasymptotic theory of independence","author":"Boucheron St\u00e9phane","key":"e_1_3_2_2_11_1","unstructured":"St\u00e9phane Boucheron , G\u00e1bor Lugosi , and Pascal Massart . 2013. Concentration inequalities: A nonasymptotic theory of independence . Oxford university press . St\u00e9phane Boucheron, G\u00e1bor Lugosi, and Pascal Massart. 2013. Concentration inequalities: A nonasymptotic theory of independence. Oxford university press."},{"key":"e_1_3_2_2_12_1","volume-title":"Stability and generalization. The Journal of Machine Learning Research","author":"Bousquet Olivier","year":"2002","unstructured":"Olivier Bousquet and Andr\u00e9 Elisseeff . 2002. Stability and generalization. The Journal of Machine Learning Research ( 2002 ), 499--526. Olivier Bousquet and Andr\u00e9 Elisseeff. 2002. Stability and generalization. The Journal of Machine Learning Research (2002), 499--526."},{"key":"e_1_3_2_2_13_1","volume-title":"Conference on Learning Theory. 610--626","author":"Bousquet Olivier","year":"2020","unstructured":"Olivier Bousquet , Yegor Klochkov , and Nikita Zhivotovskiy . 2020 . Sharper bounds for uniformly stable algorithms . In Conference on Learning Theory. 610--626 . Olivier Bousquet, Yegor Klochkov, and Nikita Zhivotovskiy. 2020. Sharper bounds for uniformly stable algorithms. In Conference on Learning Theory. 610--626."},{"key":"e_1_3_2_2_14_1","volume-title":"Proceedings of the 38th International Conference on Machine Learning. 1136--1146","author":"Bun Mark","year":"2021","unstructured":"Mark Bun , Marek Elias , and Janardhan Kulkarni . 2021 . Differentially Private Correlation Clustering . In Proceedings of the 38th International Conference on Machine Learning. 1136--1146 . Mark Bun, Marek Elias, and Janardhan Kulkarni. 2021. Differentially Private Correlation Clustering. In Proceedings of the 38th International Conference on Machine Learning. 1136--1146."},{"key":"e_1_3_2_2_15_1","volume-title":"The Secret Sharer: Evaluating and Testing Unintended Memorization in Neural Networks. In 28th USENIX Security Symposium (USENIX Security 19)","author":"Carlini Nicholas","year":"2019","unstructured":"Nicholas Carlini , Chang Liu , \u00dalfar Erlingsson , Jernej Kos , and Dawn Song . 2019 . The Secret Sharer: Evaluating and Testing Unintended Memorization in Neural Networks. In 28th USENIX Security Symposium (USENIX Security 19) . 267--284. Nicholas Carlini, Chang Liu, \u00dalfar Erlingsson, Jernej Kos, and Dawn Song. 2019. The Secret Sharer: Evaluating and Testing Unintended Memorization in Neural Networks. In 28th USENIX Security Symposium (USENIX Security 19). 267--284."},{"key":"e_1_3_2_2_16_1","volume-title":"Proceedings of the 35th International Conference on Machine Learning. 745--754","author":"Charles Zachary","year":"2018","unstructured":"Zachary Charles and Dimitris Papailiopoulos . 2018 . Stability and Generalization of Learning Algorithms that Converge to Global Optima . In Proceedings of the 35th International Conference on Machine Learning. 745--754 . Zachary Charles and Dimitris Papailiopoulos. 2018. Stability and Generalization of Learning Algorithms that Converge to Global Optima. In Proceedings of the 35th International Conference on Machine Learning. 745--754."},{"key":"e_1_3_2_2_17_1","volume-title":"Differentially private empirical risk minimization. Journal of Machine Learning Research","author":"Chaudhuri Kamalika","year":"2011","unstructured":"Kamalika Chaudhuri , Claire Monteleoni , and Anand D Sarwate . 2011. Differentially private empirical risk minimization. Journal of Machine Learning Research ( 2011 ), 1069--1109. Kamalika Chaudhuri, Claire Monteleoni, and Anand D Sarwate. 2011. Differentially private empirical risk minimization. Journal of Machine Learning Research (2011), 1069--1109."},{"key":"e_1_3_2_2_18_1","unstructured":"Bolin Ding Janardhan Kulkarni and Sergey Yekhanin. 2017. Collecting Telemetry Data Privately. In Advances in Neural Information Processing Systems. 3571--3580.  Bolin Ding Janardhan Kulkarni and Sergey Yekhanin. 2017. Collecting Telemetry Data Privately. In Advances in Neural Information Processing Systems. 3571--3580."},{"key":"e_1_3_2_2_19_1","unstructured":"Dheeru Dua and Casey Graff. 2017. UCI Machine Learning Repository.  Dheeru Dua and Casey Graff. 2017. UCI Machine Learning Repository."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Cynthia Dwork Frank McSherry Kobbi Nissim and Adam Smith. 2006. Calibrating noise to sensitivity in private data analysis. In Theory of cryptography conference. 265--284.  Cynthia Dwork Frank McSherry Kobbi Nissim and Adam Smith. 2006. Calibrating noise to sensitivity in private data analysis. In Theory of cryptography conference. 265--284.","DOI":"10.1007\/11681878_14"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"Cynthia Dwork Aaron Roth etal 2014. The algorithmic foundations of differential privacy. Foundations and Trends\u00ae in Theoretical Computer Science (2014) 211--407.  Cynthia Dwork Aaron Roth et al. 2014. The algorithmic foundations of differential privacy. Foundations and Trends\u00ae in Theoretical Computer Science (2014) 211--407.","DOI":"10.1561\/0400000042"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660348"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384335"},{"key":"e_1_3_2_2_24_1","series-title":"SIAM Journal on Control and Optimization","volume-title":"Recursive stochastic algorithms for global optimization in R d","author":"Gelfand Saul B","year":"1991","unstructured":"Saul B Gelfand and Sanjoy K Mitter . 1991. Recursive stochastic algorithms for global optimization in R d . SIAM Journal on Control and Optimization ( 1991 ), 999--1018. Saul B Gelfand and Sanjoy K Mitter. 1991. Recursive stochastic algorithms for global optimization in R d. SIAM Journal on Control and Optimization (1991), 999--1018."},{"key":"e_1_3_2_2_25_1","volume-title":"Identity Matters in Deep Learning. In 5th International Conference on Learning Representations","author":"Hardt Moritz","year":"2017","unstructured":"Moritz Hardt and Tengyu Ma . 2017 . Identity Matters in Deep Learning. In 5th International Conference on Learning Representations , 2017. Moritz Hardt and Tengyu Ma. 2017. Identity Matters in Deep Learning. In 5th International Conference on Learning Representations, 2017."},{"key":"e_1_3_2_2_26_1","volume-title":"Gradient Descent Learns Linear Dynamical Systems. Journal of Machine Learning Research","author":"Hardt Moritz","year":"2018","unstructured":"Moritz Hardt , Tengyu Ma , and Benjamin Recht . 2018. Gradient Descent Learns Linear Dynamical Systems. Journal of Machine Learning Research ( 2018 ), 29:1--29:44. Moritz Hardt, Tengyu Ma, and Benjamin Recht. 2018. Gradient Descent Learns Linear Dynamical Systems. Journal of Machine Learning Research (2018), 29:1--29:44."},{"key":"e_1_3_2_2_27_1","unstructured":"Mikko Heikkil\u00e4 Joonas J\u00e4lk\u00f6 Onur Dikmen and Antti Honkela. 2019. Differentially Private Markov Chain Monte Carlo. In Advances in Neural Information Processing Systems 32. 4115--4125.  Mikko Heikkil\u00e4 Joonas J\u00e4lk\u00f6 Onur Dikmen and Antti Honkela. 2019. Differentially Private Markov Chain Monte Carlo. In Advances in Neural Information Processing Systems 32. 4115--4125."},{"key":"e_1_3_2_2_28_1","volume-title":"Proceedings of Thirty Third Conference on Learning Theory. 1894--1938","author":"Hinder Oliver","year":"2020","unstructured":"Oliver Hinder , Aaron Sidford , and Nimit Sohoni . 2020 . Near-Optimal Methods for Minimizing Star-Convex Functions and Beyond . In Proceedings of Thirty Third Conference on Learning Theory. 1894--1938 . Oliver Hinder, Aaron Sidford, and Nimit Sohoni. 2020. Near-Optimal Methods for Minimizing Star-Convex Functions and Beyond. In Proceedings of Thirty Third Conference on Learning Theory. 1894--1938."},{"key":"e_1_3_2_2_29_1","volume-title":"Proceedings of the 28th USENIX Conference on Security Symposium. 1895--1912","author":"Jayaraman Bargav","year":"2019","unstructured":"Bargav Jayaraman and David Evans . 2019 . Evaluating Differentially Private Machine Learning in Practice . In Proceedings of the 28th USENIX Conference on Security Symposium. 1895--1912 . Bargav Jayaraman and David Evans. 2019. Evaluating Differentially Private Machine Learning in Practice. In Proceedings of the 28th USENIX Conference on Security Symposium. 1895--1912."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46128-1_50"},{"key":"e_1_3_2_2_31_1","volume-title":"Conference on Learning Theory. 25--1.","author":"Kifer Daniel","year":"2012","unstructured":"Daniel Kifer , Adam Smith , and Abhradeep Thakurta . 2012 . Private convex empirical risk minimization and high-dimensional regression . In Conference on Learning Theory. 25--1. Daniel Kifer, Adam Smith, and Abhradeep Thakurta. 2012. Private convex empirical risk minimization and high-dimensional regression. In Conference on Learning Theory. 25--1."},{"key":"e_1_3_2_2_32_1","volume-title":"Proceedings of the 35th International Conference on Machine Learning. 2698--2707","author":"Kleinberg Bobby","year":"2018","unstructured":"Bobby Kleinberg , Yuanzhi Li , and Yang Yuan . 2018 . An Alternative View: When Does SGD Escape Local Minima? . In Proceedings of the 35th International Conference on Machine Learning. 2698--2707 . Bobby Kleinberg, Yuanzhi Li, and Yang Yuan. 2018. An Alternative View: When Does SGD Escape Local Minima?. In Proceedings of the 35th International Conference on Machine Learning. 2698--2707."},{"key":"e_1_3_2_2_33_1","volume-title":"Stability and Deviation Optimal Risk Bounds with Convergence Rate O (1\/n) . arXiv preprint arXiv:2103.12024","author":"Klochkov Yegor","year":"2021","unstructured":"Yegor Klochkov and Nikita Zhivotovskiy . 2021. Stability and Deviation Optimal Risk Bounds with Convergence Rate O (1\/n) . arXiv preprint arXiv:2103.12024 ( 2021 ). Yegor Klochkov and Nikita Zhivotovskiy. 2021. Stability and Deviation Optimal Risk Bounds with Convergence Rate O (1\/n) . arXiv preprint arXiv:2103.12024 (2021)."},{"key":"e_1_3_2_2_34_1","volume-title":"Local Rademacher complexities and oracle inequalities in risk minimization. The Annals of Statistics","author":"Koltchinskii Vladimir","year":"2006","unstructured":"Vladimir Koltchinskii . 2006. Local Rademacher complexities and oracle inequalities in risk minimization. The Annals of Statistics ( 2006 ), 2593--2656. Vladimir Koltchinskii. 2006. Local Rademacher complexities and oracle inequalities in risk minimization. The Annals of Statistics (2006), 2593--2656."},{"key":"e_1_3_2_2_35_1","volume-title":"Proceedings of the 38th International Conference on Machine Learning. 5838--5849","author":"Kulkarni Tejas","year":"2021","unstructured":"Tejas Kulkarni , Joonas J\u00e4lk\u00f6 , Antti Koskela , Samuel Kaski , and Antti Honkela . 2021 . Differentially Private Bayesian Inference for Generalized Linear Models . In Proceedings of the 38th International Conference on Machine Learning. 5838--5849 . Tejas Kulkarni, Joonas J\u00e4lk\u00f6, Antti Koskela, Samuel Kaski, and Antti Honkela. 2021. Differentially Private Bayesian Inference for Generalized Linear Models. In Proceedings of the 38th International Conference on Machine Learning. 5838--5849."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3068154"},{"key":"e_1_3_2_2_37_1","volume-title":"Proceedings of the 37th International Conference on Machine Learning. 5809--5819","author":"Lei Yunwen","year":"2020","unstructured":"Yunwen Lei and Yiming Ying . 2020 a. Fine-Grained Analysis of Stability and Generalization for Stochastic Gradient Descent . In Proceedings of the 37th International Conference on Machine Learning. 5809--5819 . Yunwen Lei and Yiming Ying. 2020a. Fine-Grained Analysis of Stability and Generalization for Stochastic Gradient Descent. In Proceedings of the 37th International Conference on Machine Learning. 5809--5819."},{"key":"e_1_3_2_2_38_1","volume-title":"International Conference on Learning Representations.","author":"Lei Yunwen","year":"2020","unstructured":"Yunwen Lei and Yiming Ying . 2020 b. Sharper generalization bounds for learning with gradient-dominated objective functions . In International Conference on Learning Representations. Yunwen Lei and Yiming Ying. 2020b. Sharper generalization bounds for learning with gradient-dominated objective functions. In International Conference on Learning Representations."},{"key":"e_1_3_2_2_39_1","volume-title":"On Generalization Error Bounds of Noisy Gradient Methods for Non-Convex Learning. In 8th International Conference on Learning Representations. OpenReview.net.","author":"Li Jian","year":"2020","unstructured":"Jian Li , Xuanyuan Luo , and Mingda Qiao . 2020 . On Generalization Error Bounds of Noisy Gradient Methods for Non-Convex Learning. In 8th International Conference on Learning Representations. OpenReview.net. Jian Li, Xuanyuan Luo, and Mingda Qiao. 2020. On Generalization Error Bounds of Noisy Gradient Methods for Non-Convex Learning. In 8th International Conference on Learning Representations. OpenReview.net."},{"key":"e_1_3_2_2_40_1","unstructured":"Shaojie Li and Yong Liu. 2021. Improved Learning Rates for Stochastic Optimization: Two Theoretical Viewpoints. arxiv: 2107.08686  Shaojie Li and Yong Liu. 2021. Improved Learning Rates for Stochastic Optimization: Two Theoretical Viewpoints. arxiv: 2107.08686"},{"key":"e_1_3_2_2_41_1","volume-title":"robust, and reliable blind deconvolution via nonconvex optimization. Applied and computational harmonic analysis","author":"Li Xiaodong","year":"2019","unstructured":"Xiaodong Li , Shuyang Ling , Thomas Strohmer , and Ke Wei . 2019. Rapid , robust, and reliable blind deconvolution via nonconvex optimization. Applied and computational harmonic analysis ( 2019 ), 893--934. Xiaodong Li, Shuyang Ling, Thomas Strohmer, and Ke Wei. 2019. Rapid, robust, and reliable blind deconvolution via nonconvex optimization. Applied and computational harmonic analysis (2019), 893--934."},{"key":"e_1_3_2_2_42_1","first-page":"2017","article-title":"Convergence Analysis of Two-layer Neural Networks with ReLU Activation","volume":"30","author":"Li Yuanzhi","year":"2017","unstructured":"Yuanzhi Li and Yang Yuan . 2017 . Convergence Analysis of Two-layer Neural Networks with ReLU Activation . In Advances in Neural Information Processing Systems 30 , 2017 . 597--607. Yuanzhi Li and Yang Yuan. 2017. Convergence Analysis of Two-layer Neural Networks with ReLU Activation. In Advances in Neural Information Processing Systems 30, 2017. 597--607.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_43_1","volume-title":"Proceedings of the 33nd International Conference on Machine Learning","author":"Liu Huikang","year":"2016","unstructured":"Huikang Liu , Weijie Wu , and Anthony Man-Cho So . 2016 . Quadratic Optimization with Orthogonality Constraints: Explicit Lojasiewicz Exponent and Linear Convergence of Line-Search Methods . In Proceedings of the 33nd International Conference on Machine Learning , 2016. 1158--1167. Huikang Liu, Weijie Wu, and Anthony Man-Cho So. 2016. Quadratic Optimization with Orthogonality Constraints: Explicit Lojasiewicz Exponent and Linear Convergence of Line-Search Methods. In Proceedings of the 33nd International Conference on Machine Learning, 2016. 1158--1167."},{"key":"e_1_3_2_2_44_1","volume-title":"Apple tries to peek at user habits without violating privacy. The Wall Street Journal","author":"McMillan Robert","year":"2016","unstructured":"Robert McMillan . 2016. Apple tries to peek at user habits without violating privacy. The Wall Street Journal ( 2016 ). Robert McMillan. 2016. Apple tries to peek at user habits without violating privacy. The Wall Street Journal (2016)."},{"key":"e_1_3_2_2_45_1","volume-title":"Proceedings of the 38th International Conference on Machine Learning. 8140--8151","author":"Nguyen Dung","year":"2021","unstructured":"Dung Nguyen and Anil Vullikanti . 2021 . Differentially Private Densest Subgraph Detection . In Proceedings of the 38th International Conference on Machine Learning. 8140--8151 . Dung Nguyen and Anil Vullikanti. 2021. Differentially Private Densest Subgraph Detection. In Proceedings of the 38th International Conference on Machine Learning. 8140--8151."},{"volume-title":"Smart Healthcare Technologies for Massive Internet of Medical Things","author":"Ponnusamy Vijayakumar","key":"e_1_3_2_2_46_1","unstructured":"Vijayakumar Ponnusamy , J. Christopher Clement , K. C. Sriharipriya , and Sowmya Natarajan . 2021. Smart Healthcare Technologies for Massive Internet of Medical Things . Springer International Publishing , 71--101. Vijayakumar Ponnusamy, J. Christopher Clement, K. C. Sriharipriya, and Sowmya Natarajan. 2021. Smart Healthcare Technologies for Massive Internet of Medical Things. Springer International Publishing, 71--101."},{"key":"e_1_3_2_2_47_1","volume-title":"Proceedings of the 2017 Conference on Learning Theory. 1674--1703","author":"Raginsky Maxim","year":"2017","unstructured":"Maxim Raginsky , Alexander Rakhlin , and Matus Telgarsky . 2017 . Non-convex learning via Stochastic Gradient Langevin Dynamics: a nonasymptotic analysis . In Proceedings of the 2017 Conference on Learning Theory. 1674--1703 . Maxim Raginsky, Alexander Rakhlin, and Matus Telgarsky. 2017. Non-convex learning via Stochastic Gradient Langevin Dynamics: a nonasymptotic analysis. In Proceedings of the 2017 Conference on Learning Theory. 1674--1703."},{"key":"e_1_3_2_2_48_1","volume-title":"Membership Inference Attacks Against Machine Learning Models. In 2017 IEEE Symposium on Security and Privacy","author":"Shokri Reza","year":"2017","unstructured":"Reza Shokri , Marco Stronati , Congzheng Song , and Vitaly Shmatikov . 2017 . Membership Inference Attacks Against Machine Learning Models. In 2017 IEEE Symposium on Security and Privacy , 2017. 3--18. Reza Shokri, Marco Stronati, Congzheng Song, and Vitaly Shmatikov. 2017. Membership Inference Attacks Against Machine Learning Models. In 2017 IEEE Symposium on Security and Privacy, 2017. 3--18."},{"volume-title":"Role of Sensors, Devices and Technology for Detection of COVID-19 Virus","author":"Singha Monoj Kumar","key":"e_1_3_2_2_49_1","unstructured":"Monoj Kumar Singha , Priyanka Dwivedi , Gaurav Sankhe , Aniket Patra , and Vineet Rojwal . 2021. Role of Sensors, Devices and Technology for Detection of COVID-19 Virus . Springer International Publishing , 293--312. Monoj Kumar Singha, Priyanka Dwivedi, Gaurav Sankhe, Aniket Patra, and Vineet Rojwal. 2021. Role of Sensors, Devices and Technology for Detection of COVID-19 Virus. Springer International Publishing, 293--312."},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2013.6736861"},{"volume-title":"Support vector machines","author":"Steinwart Ingo","key":"e_1_3_2_2_51_1","unstructured":"Ingo Steinwart and Andreas Christmann . 2008. Support vector machines . Springer Science & Business Media . Ingo Steinwart and Andreas Christmann. 2008. Support vector machines. Springer Science & Business Media."},{"key":"e_1_3_2_2_52_1","volume-title":"A Geometric Analysis of Phase Retrieval. Foundations of Computational Mathematics","author":"Sun Ju","year":"2018","unstructured":"Ju Sun , Qing Qu , and John Wright . 2018. A Geometric Analysis of Phase Retrieval. Foundations of Computational Mathematics ( 2018 ), 1131--1198. Ju Sun, Qing Qu, and John Wright. 2018. A Geometric Analysis of Phase Retrieval. Foundations of Computational Mathematics (2018), 1131--1198."},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"crossref","unstructured":"G. Swapna and K. P. Soman. 2021. Diabetes Detection and Sensor-Based Continuous Glucose Monitoring -- A Deep Learning Approach. Springer International Publishing 245--268.  G. Swapna and K. P. Soman. 2021. Diabetes Detection and Sensor-Based Continuous Glucose Monitoring -- A Deep Learning Approach. Springer International Publishing 245--268.","DOI":"10.1007\/978-3-030-66633-0_11"},{"key":"e_1_3_2_2_54_1","unstructured":"Jonathan Ullman and Adam Sealfon. 2019. Efficiently Estimating Erdos-Renyi Graphs with Node Differential Privacy. In Advances in Neural Information Processing Systems. 3765--3775.  Jonathan Ullman and Adam Sealfon. 2019. Efficiently Estimating Erdos-Renyi Graphs with Node Differential Privacy. In Advances in Neural Information Processing Systems. 3765--3775."},{"key":"e_1_3_2_2_55_1","volume-title":"Proceedings of the 36th International Conference on Machine Learning, ICML 2019. 6526--6535","author":"Wang Di","year":"2019","unstructured":"Di Wang , Changyou Chen , and Jinhui Xu . 2019 . Differentially Private Empirical Risk Minimization with Non-convex Loss Functions . In Proceedings of the 36th International Conference on Machine Learning, ICML 2019. 6526--6535 . Di Wang, Changyou Chen, and Jinhui Xu. 2019. Differentially Private Empirical Risk Minimization with Non-convex Loss Functions. In Proceedings of the 36th International Conference on Machine Learning, ICML 2019. 6526--6535."},{"key":"e_1_3_2_2_56_1","volume-title":"Principal component analysis in the local differential privacy model. Theoretical Computer Science","author":"Wang Di","year":"2019","unstructured":"Di Wang and Jinhui Xu. 2019. Principal component analysis in the local differential privacy model. Theoretical Computer Science ( 2019 ). Di Wang and Jinhui Xu. 2019. Principal component analysis in the local differential privacy model. Theoretical Computer Science (2019)."},{"key":"e_1_3_2_2_57_1","unstructured":"Di Wang Minwei Ye and Jinhui Xu. 2017. Differentially private empirical risk minimization revisited: Faster and more general. In Advances in Neural Information Processing Systems. 2722--2731.  Di Wang Minwei Ye and Jinhui Xu. 2017. Differentially private empirical risk minimization revisited: Faster and more general. In Advances in Neural Information Processing Systems. 2722--2731."},{"key":"e_1_3_2_2_58_1","volume-title":"Differentially private sgd with non-smooth loss. arXiv preprint arXiv:2101.08925","author":"Wang Puyu","year":"2021","unstructured":"Puyu Wang , Yunwen Lei , Yiming Ying , and Hai Zhang . 2021. Differentially private sgd with non-smooth loss. arXiv preprint arXiv:2101.08925 ( 2021 ). Puyu Wang, Yunwen Lei, Yiming Ying, and Hai Zhang. 2021. Differentially private sgd with non-smooth loss. arXiv preprint arXiv:2101.08925 (2021)."},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064047"},{"key":"e_1_3_2_2_60_1","volume-title":"GANobfuscator: Mitigating information leakage under GAN via differential privacy","author":"Xu Chugui","year":"2019","unstructured":"Chugui Xu , Ju Ren , Deyu Zhang , Yaoxue Zhang , Zhan Qin , and Kui Ren . 2019. GANobfuscator: Mitigating information leakage under GAN via differential privacy . IEEE Transactions on Information Forensics and Security ( 2019 ), 2358--2371. Chugui Xu, Ju Ren, Deyu Zhang, Yaoxue Zhang, Zhan Qin, and Kui Ren. 2019. GANobfuscator: Mitigating information leakage under GAN via differential privacy. IEEE Transactions on Information Forensics and Security (2019), 2358--2371."},{"key":"e_1_3_2_2_61_1","volume-title":"International Conference on Artificial Intelligence and Statistics. 2026--2034","author":"Yang Zhenhuan","year":"2021","unstructured":"Zhenhuan Yang , Yunwen Lei , Siwei Lyu , and Yiming Ying . 2021 . Stability and differential privacy of stochastic gradient descent for pairwise learning with non-smooth loss . In International Conference on Artificial Intelligence and Statistics. 2026--2034 . Zhenhuan Yang, Yunwen Lei, Siwei Lyu, and Yiming Ying. 2021. Stability and differential privacy of stochastic gradient descent for pairwise learning with non-smooth loss. In International Conference on Artificial Intelligence and Statistics. 2026--2034."},{"key":"e_1_3_2_2_62_1","volume-title":"Unregularized online learning algorithms with general loss functions. Applied and Computational Harmonic Analysis","author":"Ying Yiming","year":"2017","unstructured":"Yiming Ying and Ding-Xuan Zhou . 2017. Unregularized online learning algorithms with general loss functions. Applied and Computational Harmonic Analysis ( 2017 ), 224--244. Yiming Ying and Ding-Xuan Zhou. 2017. Unregularized online learning algorithms with general loss functions. Applied and Computational Harmonic Analysis (2017), 224--244."},{"key":"e_1_3_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/548"},{"key":"e_1_3_2_2_64_1","volume-title":"7th International Conference on Learning Representations","author":"Zhou Yi","year":"2019","unstructured":"Yi Zhou , Junjie Yang , Huishuai Zhang , Yingbin Liang , and Vahid Tarokh . 2019 . SGD Converges to Global Minimum in Deep Learning via Star-convex Path . In 7th International Conference on Learning Representations , 2019. Yi Zhou, Junjie Yang, Huishuai Zhang, Yingbin Liang, and Vahid Tarokh. 2019. SGD Converges to Global Minimum in Deep Learning via Star-convex Path. In 7th International Conference on Learning Representations, 2019."}],"event":{"name":"CIKM '22: The 31st ACM International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Atlanta GA USA","acronym":"CIKM '22"},"container-title":["Proceedings of the 31st ACM International Conference on Information & Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3511808.3557451","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3511808.3557451","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:55Z","timestamp":1750182535000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3511808.3557451"}},"subtitle":["Smooth and Non-smooth"],"short-title":[],"issued":{"date-parts":[[2022,10,17]]},"references-count":64,"alternative-id":["10.1145\/3511808.3557451","10.1145\/3511808"],"URL":"https:\/\/doi.org\/10.1145\/3511808.3557451","relation":{},"subject":[],"published":{"date-parts":[[2022,10,17]]},"assertion":[{"value":"2022-10-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}