{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T13:44:16Z","timestamp":1774964656664,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,12]],"date-time":"2022-06-12T00:00:00Z","timestamp":1654992000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004052","name":"King Abdullah University of Science and Technology","doi-asserted-by":"publisher","award":["BAS\/1\/1689-01-01"],"award-info":[{"award-number":["BAS\/1\/1689-01-01"]}],"id":[{"id":"10.13039\/501100004052","id-type":"DOI","asserted-by":"publisher"}]},{"name":"King Abdullah University of Science and Technology","award":["REI\/1\/4811- 10-01"],"award-info":[{"award-number":["REI\/1\/4811- 10-01"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,12]]},"DOI":"10.1145\/3517804.3524144","type":"proceedings-article","created":{"date-parts":[[2022,6,13]],"date-time":"2022-06-13T13:29:54Z","timestamp":1655126994000},"page":"227-236","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["High Dimensional Differentially Private Stochastic Optimization with Heavy-tailed Data"],"prefix":"10.1145","author":[{"given":"Lijie","family":"Hu","sequence":"first","affiliation":[{"name":"King Abdullah University of Science and Technology, Thuwal, Makkah, Saudi Arabia"}]},{"given":"Shuo","family":"Ni","sequence":"additional","affiliation":[{"name":"University of Southern California, Los Angeles, CA, USA"}]},{"given":"Hanshen","family":"Xiao","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}]},{"given":"Di","family":"Wang","sequence":"additional","affiliation":[{"name":"King Abdullah University of Science and Technology, Thuwal, Makkah, Saudi Arabia"}]}],"member":"320","published-online":{"date-parts":[[2022,6,13]]},"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","volume-title":"Private Stochastic Convex Optimization: Optimal Rates in l1 Geometry. arXiv preprint arXiv:2103.01516","author":"Asi Hilal","year":"2021","unstructured":"Hilal Asi , Vitaly Feldman , Tomer Koren , and Kunal Talwar . 2021. Private Stochastic Convex Optimization: Optimal Rates in l1 Geometry. arXiv preprint arXiv:2103.01516 ( 2021 ). Hilal Asi, Vitaly Feldman, Tomer Koren, and Kunal Talwar. 2021. Private Stochastic Convex Optimization: Optimal Rates in l1 Geometry. arXiv preprint arXiv:2103.01516 (2021)."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/2567709.2502607"},{"key":"e_1_3_2_2_4_1","volume-title":"Privacy and statistical risk: Formalisms and minimax bounds. arXiv preprint arXiv:1412.4451","author":"Barber Rina Foygel","year":"2014","unstructured":"Rina Foygel Barber and John C Duchi . 2014. Privacy and statistical risk: Formalisms and minimax bounds. arXiv preprint arXiv:1412.4451 ( 2014 ). Rina Foygel Barber and John C Duchi. 2014. Privacy and statistical risk: Formalisms and minimax bounds. arXiv preprint arXiv:1412.4451 (2014)."},{"key":"e_1_3_2_2_5_1","volume-title":"Advances in Neural Information Processing Systems","volume":"33","author":"Bassily Raef","year":"2020","unstructured":"Raef Bassily , Vitaly Feldman , Crist\u00f3bal Guzm\u00e1n , and Kunal Talwar . 2020 . Stability of stochastic gradient descent on nonsmooth convex losses . Advances in Neural Information Processing Systems , Vol. 33 (2020). Raef Bassily, Vitaly Feldman, Crist\u00f3bal Guzm\u00e1n, and Kunal Talwar. 2020. Stability of stochastic gradient descent on nonsmooth convex losses. Advances in Neural Information Processing Systems, Vol. 33 (2020)."},{"key":"e_1_3_2_2_6_1","unstructured":"Raef Bassily Vitaly Feldman Kunal Talwar and Abhradee Thakurta. 2019. Private Stochastic Convex Optimization with Optimal Rates. In NeurIPS .  Raef Bassily Vitaly Feldman Kunal Talwar and Abhradee Thakurta. 2019. Private Stochastic Convex Optimization with Optimal Rates. In NeurIPS ."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.56"},{"key":"e_1_3_2_2_8_1","volume-title":"Statistical advances in the biomedical science","author":"Biswas Atanu","unstructured":"Atanu Biswas , Sujay Datta , Jason P Fine , and Mark R Segal . 2007. Statistical advances in the biomedical science . Wiley Online Library . Atanu Biswas, Sujay Datta, Jason P Fine, and Mark R Segal. 2007. Statistical advances in the biomedical science .Wiley Online Library."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1214\/15-AOS1350"},{"key":"e_1_3_2_2_10_1","volume-title":"Propose","author":"Brunel Victor-Emmanuel","year":"2002","unstructured":"Victor-Emmanuel Brunel and Marco Avella-Medina . 2020. Propose , Test, Release : Differentially private estimation with high probability. arXiv preprint arXiv: 2002 .08774 (2020). Victor-Emmanuel Brunel and Marco Avella-Medina. 2020. Propose, Test, Release: Differentially private estimation with high probability. arXiv preprint arXiv:2002.08774 (2020)."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2277869"},{"key":"e_1_3_2_2_12_1","volume-title":"Average-Case Averages: Private Algorithms for Smooth Sensitivity and Mean Estimation. arXiv preprint arXiv:1906.02830","author":"Bun Mark","year":"2019","unstructured":"Mark Bun and Thomas Steinke . 2019. Average-Case Averages: Private Algorithms for Smooth Sensitivity and Mean Estimation. arXiv preprint arXiv:1906.02830 ( 2019 ). Mark Bun and Thomas Steinke. 2019. Average-Case Averages: Private Algorithms for Smooth Sensitivity and Mean Estimation. arXiv preprint arXiv:1906.02830 (2019)."},{"key":"e_1_3_2_2_13_1","volume-title":"The cost of privacy: Optimal rates of convergence for parameter estimation with differential privacy. arXiv preprint arXiv:1902.04495","author":"Cai T Tony","year":"2019","unstructured":"T Tony Cai , Yichen Wang , and Linjun Zhang . 2019. The cost of privacy: Optimal rates of convergence for parameter estimation with differential privacy. arXiv preprint arXiv:1902.04495 ( 2019 ). T Tony Cai, Yichen Wang, and Linjun Zhang. 2019. The cost of privacy: Optimal rates of convergence for parameter estimation with differential privacy. arXiv preprint arXiv:1902.04495 (2019)."},{"key":"e_1_3_2_2_14_1","volume-title":"The Cost of Privacy in Generalized Linear Models: Algorithms and Minimax Lower Bounds. arXiv preprint arXiv:2011.03900","author":"Cai T Tony","year":"2020","unstructured":"T Tony Cai , Yichen Wang , and Linjun Zhang . 2020. The Cost of Privacy in Generalized Linear Models: Algorithms and Minimax Lower Bounds. arXiv preprint arXiv:2011.03900 ( 2020 ). T Tony Cai, Yichen Wang, and Linjun Zhang. 2020. The Cost of Privacy in Generalized Linear Models: Algorithms and Minimax Lower Bounds. arXiv preprint arXiv:2011.03900 (2020)."},{"key":"e_1_3_2_2_15_1","volume-title":"Annales de l'IHP Probabilit\u00e9s et statistiques","author":"Catoni Olivier","unstructured":"Olivier Catoni . 2012. Challenging the empirical mean and empirical variance: a deviation study . In Annales de l'IHP Probabilit\u00e9s et statistiques , Vol. 48 . 1148--1185. Olivier Catoni. 2012. Challenging the empirical mean and empirical variance: a deviation study. In Annales de l'IHP Probabilit\u00e9s et statistiques, Vol. 48. 1148--1185."},{"key":"e_1_3_2_2_16_1","volume-title":"Dimension-free PAC-Bayesian bounds for matrices, vectors, and linear least squares regression. arXiv preprint arXiv:1712.02747","author":"Catoni Olivier","year":"2017","unstructured":"Olivier Catoni and Ilaria Giulini . 2017. Dimension-free PAC-Bayesian bounds for matrices, vectors, and linear least squares regression. arXiv preprint arXiv:1712.02747 ( 2017 ). Olivier Catoni and Ilaria Giulini. 2017. Dimension-free PAC-Bayesian bounds for matrices, vectors, and linear least squares regression. arXiv preprint arXiv:1712.02747 (2017)."},{"key":"e_1_3_2_2_17_1","unstructured":"Kamalika Chaudhuri and Claire Monteleoni. 2009. Privacy-preserving logistic regression. In Advances in neural information processing systems. 289--296.  Kamalika Chaudhuri and Claire Monteleoni. 2009. Privacy-preserving logistic regression. In Advances in neural information processing systems. 289--296."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2021036"},{"key":"e_1_3_2_2_19_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_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.53"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2017.1389735"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536466"},{"key":"e_1_3_2_2_23_1","volume-title":"Theory of cryptography conference","author":"Dwork Cynthia","unstructured":"Cynthia Dwork , Frank McSherry , Kobbi Nissim , and Adam Smith . 2006. Calibrating noise to sensitivity in private data analysis . In Theory of cryptography conference . Springer , 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. Springer, 265--284."},{"key":"e_1_3_2_2_24_1","first-page":"3","article-title":"The algorithmic foundations of differential privacy","volume":"9","author":"Dwork Cynthia","year":"2014","unstructured":"Cynthia Dwork , Aaron Roth , 2014 . The algorithmic foundations of differential privacy . Foundations and Trends in Theoretical Computer Science , Vol. 9 , 3 -- 4 (2014), 211--407. Cynthia Dwork, Aaron Roth, et al. 2014. The algorithmic foundations of differential privacy. Foundations and Trends in Theoretical Computer Science, Vol. 9, 3--4 (2014), 211--407.","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"key":"e_1_3_2_2_25_1","volume-title":"A shrinkage principle for heavy-tailed data: High-dimensional robust low-rank matrix recovery. arXiv preprint arXiv:1603.08315","author":"Fan Jianqing","year":"2016","unstructured":"Jianqing Fan , Weichen Wang , and Ziwei Zhu . 2016. A shrinkage principle for heavy-tailed data: High-dimensional robust low-rank matrix recovery. arXiv preprint arXiv:1603.08315 ( 2016 ). Jianqing Fan, Weichen Wang, and Ziwei Zhu. 2016. A shrinkage principle for heavy-tailed data: High-dimensional robust low-rank matrix recovery. arXiv preprint arXiv:1603.08315 (2016)."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384335"},{"key":"e_1_3_2_2_27_1","volume-title":"International Conference on Machine Learning. 2761--2770","author":"Holland Matthew","year":"2019","unstructured":"Matthew Holland and Kazushi Ikeda . 2019 . Better generalization with less data using robust gradient descent . In International Conference on Machine Learning. 2761--2770 . Matthew Holland and Kazushi Ikeda. 2019. Better generalization with less data using robust gradient descent. In International Conference on Machine Learning. 2761--2770."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/2946645.2946663"},{"key":"e_1_3_2_2_29_1","volume-title":"High Dimensional Differentially Private Stochastic Optimization with Heavy-tailed Data. arXiv preprint arXiv:2107.11136","author":"Hu Lijie","year":"2021","unstructured":"Lijie Hu , Shuo Ni , Hanshen Xiao , and Di Wang . 2021. High Dimensional Differentially Private Stochastic Optimization with Heavy-tailed Data. arXiv preprint arXiv:2107.11136 ( 2021 ). Lijie Hu, Shuo Ni, Hanshen Xiao, and Di Wang. 2021. High Dimensional Differentially Private Stochastic Optimization with Heavy-tailed Data. arXiv preprint arXiv:2107.11136 (2021)."},{"key":"e_1_3_2_2_30_1","volume-title":"Heavy-tailed distributions and robustness in economics and finance","author":"Ibragimov Marat","unstructured":"Marat Ibragimov , Rustam Ibragimov , and Johan Walden . 2015. Heavy-tailed distributions and robustness in economics and finance . Vol. 214 . Springer . Marat Ibragimov, Rustam Ibragimov, and Johan Walden. 2015. Heavy-tailed distributions and robustness in economics and finance. Vol. 214. Springer."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2019.00001"},{"key":"e_1_3_2_2_32_1","volume-title":"Improved Rates for Differentially Private Stochastic Convex Optimization with Heavy-Tailed Data. arXiv preprint arXiv:2106.01336","author":"Kamath Gautam","year":"2021","unstructured":"Gautam Kamath , Xingtu Liu , and Huanyu Zhang . 2021. Improved Rates for Differentially Private Stochastic Convex Optimization with Heavy-Tailed Data. arXiv preprint arXiv:2106.01336 ( 2021 ). Gautam Kamath, Xingtu Liu, and Huanyu Zhang. 2021. Improved Rates for Differentially Private Stochastic Convex Optimization with Heavy-Tailed Data. arXiv preprint arXiv:2106.01336 (2021)."},{"key":"e_1_3_2_2_33_1","volume-title":"Conference on Learning Theory. PMLR, 2204--2235","author":"Kamath Gautam","year":"2020","unstructured":"Gautam Kamath , Vikrant Singhal , and Jonathan Ullman . 2020 . Private mean estimation of heavy-tailed distributions . In Conference on Learning Theory. PMLR, 2204--2235 . Gautam Kamath, Vikrant Singhal, and Jonathan Ullman. 2020. Private mean estimation of heavy-tailed distributions. In Conference on Learning Theory. PMLR, 2204--2235."},{"key":"e_1_3_2_2_34_1","volume-title":"International Conference on Machine Learning. 488--497","author":"Kasiviswanathan Shiva Prasad","year":"2016","unstructured":"Shiva Prasad Kasiviswanathan and Hongxia Jin . 2016 . Efficient private empirical risk minimization for high-dimensional learning . In International Conference on Machine Learning. 488--497 . Shiva Prasad Kasiviswanathan and Hongxia Jin. 2016. Efficient private empirical risk minimization for high-dimensional learning. In International Conference on Machine Learning. 488--497."},{"key":"e_1_3_2_2_35_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_36_1","volume-title":"Robust classification via MOM minimization. arXiv preprint arXiv:1808.03106","author":"Lecu\u00e9 Guillaume","year":"2018","unstructured":"Guillaume Lecu\u00e9 , Matthieu Lerasle , and Timoth\u00e9e Mathieu . 2018. Robust classification via MOM minimization. arXiv preprint arXiv:1808.03106 ( 2018 ). Guillaume Lecu\u00e9, Matthieu Lerasle, and Timoth\u00e9e Mathieu. 2018. Robust classification via MOM minimization. arXiv preprint arXiv:1808.03106 (2018)."},{"key":"e_1_3_2_2_37_1","volume-title":"Robust and differentially private mean estimation. arXiv preprint arXiv:2102.09159","author":"Liu Xiyang","year":"2021","unstructured":"Xiyang Liu , Weihao Kong , Sham Kakade , and Sewoong Oh. 2021. Robust and differentially private mean estimation. arXiv preprint arXiv:2102.09159 ( 2021 ). Xiyang Liu, Weihao Kong, Sham Kakade, and Sewoong Oh. 2021. Robust and differentially private mean estimation. arXiv preprint arXiv:2102.09159 (2021)."},{"key":"e_1_3_2_2_38_1","unstructured":"Po-Ling Loh and Martin J Wainwright. 2013. Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optima. In Advances in Neural Information Processing Systems. 476--484.  Po-Ling Loh and Martin J Wainwright. 2013. Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optima. In Advances in Neural Information Processing Systems. 476--484."},{"key":"e_1_3_2_2_39_1","volume-title":"Risk minimization by median-of-means tournaments. Journal of the European Mathematical Society","author":"Lugosi G\u00e1bor","year":"2019","unstructured":"G\u00e1bor Lugosi and Shahar Mendelson . 2019. Risk minimization by median-of-means tournaments. Journal of the European Mathematical Society ( 2019 ). G\u00e1bor Lugosi and Shahar Mendelson. 2019. Risk minimization by median-of-means tournaments. Journal of the European Mathematical Society (2019)."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.3150\/14-BEJ645"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250803"},{"key":"e_1_3_2_2_42_1","volume-title":"Sivaraman Balakrishnan, and Pradeep Ravikumar.","author":"Prasad Adarsh","year":"2018","unstructured":"Adarsh Prasad , Arun Sai Suggala , Sivaraman Balakrishnan, and Pradeep Ravikumar. 2018 . Robust estimation via robust gradient estimation. arXiv preprint arXiv:1802.06485 (2018). Adarsh Prasad, Arun Sai Suggala, Sivaraman Balakrishnan, and Pradeep Ravikumar. 2018. Robust estimation via robust gradient estimation. arXiv preprint arXiv:1802.06485 (2018)."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.35"},{"key":"e_1_3_2_2_44_1","volume-title":"Characterizing private clipped gradient descent on convex generalized linear problems. arXiv preprint arXiv:2006.06783","author":"Song Shuang","year":"2020","unstructured":"Shuang Song , Om Thakkar , and Abhradeep Thakurta . 2020. Characterizing private clipped gradient descent on convex generalized linear problems. arXiv preprint arXiv:2006.06783 ( 2020 ). Shuang Song, Om Thakkar, and Abhradeep Thakurta. 2020. Characterizing private clipped gradient descent on convex generalized linear problems. arXiv preprint arXiv:2006.06783 (2020)."},{"key":"e_1_3_2_2_45_1","volume-title":"Proceedings of the 28th International Conference on Neural Information Processing Systems-Volume 2. 3025--3033","author":"Talwar Kunal","year":"2015","unstructured":"Kunal Talwar , Abhradeep Thakurta , and Li Zhang . 2015 . Nearly-optimal private LASSO . In Proceedings of the 28th International Conference on Neural Information Processing Systems-Volume 2. 3025--3033 . Kunal Talwar, Abhradeep Thakurta, and Li Zhang. 2015. Nearly-optimal private LASSO. In Proceedings of the 28th International Conference on Neural Information Processing Systems-Volume 2. 3025--3033."},{"key":"e_1_3_2_2_46_1","volume-title":"Privacy Loss in Apple's Implementation of Differential Privacy on MacOS 10.12. CoRR","author":"Tang Jun","year":"2017","unstructured":"Jun Tang , Aleksandra Korolova , Xiaolong Bai , Xueqiang Wang , and XiaoFeng Wang . 2017. Privacy Loss in Apple's Implementation of Differential Privacy on MacOS 10.12. CoRR , Vol. abs\/ 1709 .02753 ( 2017 ). arxiv: 1709.02753 Jun Tang, Aleksandra Korolova, Xiaolong Bai, Xueqiang Wang, and XiaoFeng Wang. 2017. Privacy Loss in Apple's Implementation of Differential Privacy on MacOS 10.12. CoRR, Vol. abs\/1709.02753 (2017). arxiv: 1709.02753"},{"key":"e_1_3_2_2_47_1","volume-title":"Optimal Rates of (Locally) Differentially Private Heavy-tailed Multi-Armed Bandits. arXiv preprint arXiv:2106.02575","author":"Tao Youming","year":"2021","unstructured":"Youming Tao , Yulian Wu , Peng Zhao , and Di Wang . 2021. Optimal Rates of (Locally) Differentially Private Heavy-tailed Multi-Armed Bandits. arXiv preprint arXiv:2106.02575 ( 2021 ). Youming Tao, Yulian Wu, Peng Zhao, and Di Wang. 2021. Optimal Rates of (Locally) Differentially Private Heavy-tailed Multi-Armed Bandits. arXiv preprint arXiv:2106.02575 (2021)."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3264-1"},{"key":"e_1_3_2_2_49_1","volume-title":"2020 a. Differentially Private (Gradient) Expectation Maximization Algorithm with Statistical Guarantees. CoRR","author":"Wang Di","year":"2020","unstructured":"Di Wang , Jiahao Ding , Zejun Xie , Miao Pan , and Jinhui Xu . 2020 a. Differentially Private (Gradient) Expectation Maximization Algorithm with Statistical Guarantees. CoRR , Vol. abs\/ 2010 .13520 ( 2020 ). Di Wang, Jiahao Ding, Zejun Xie, Miao Pan, and Jinhui Xu. 2020 a. Differentially Private (Gradient) Expectation Maximization Algorithm with Statistical Guarantees. CoRR, Vol. abs\/2010.13520 (2020)."},{"key":"e_1_3_2_2_50_1","first-page":"1","article-title":"b. Empirical Risk Minimization in the Non-interactive Local Model of Differential Privacy","volume":"21","author":"Wang Di","year":"2020","unstructured":"Di Wang , Marco Gaboardi , Adam Smith , and Jinhui Xu . 2020 b. Empirical Risk Minimization in the Non-interactive Local Model of Differential Privacy . Journal of Machine Learning Research , Vol. 21 , 200 (2020), 1 -- 39 . Di Wang, Marco Gaboardi, Adam Smith, and Jinhui Xu. 2020 b. Empirical Risk Minimization in the Non-interactive Local Model of Differential Privacy. Journal of Machine Learning Research, Vol. 21, 200 (2020), 1--39.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_2_51_1","volume-title":"2020 c. On Differentially Private Stochastic Convex Optimization with Heavy-tailed Data. arXiv preprint arXiv:2010.11082","author":"Wang Di","year":"2020","unstructured":"Di Wang , Hanshen Xiao , Srini Devadas , and Jinhui Xu . 2020 c. On Differentially Private Stochastic Convex Optimization with Heavy-tailed Data. arXiv preprint arXiv:2010.11082 ( 2020 ). Di Wang, Hanshen Xiao, Srini Devadas, and Jinhui Xu. 2020 c. On Differentially Private Stochastic Convex Optimization with Heavy-tailed Data. arXiv preprint arXiv:2010.11082 (2020)."},{"key":"e_1_3_2_2_52_1","volume-title":"ICML (Proceedings of Machine Learning Research","volume":"6637","author":"Wang Di","year":"2019","unstructured":"Di Wang and Jinhui Xu . 2019 . On Sparse Linear Regression in the Local Differential Privacy Model . In ICML (Proceedings of Machine Learning Research , Vol. 97). PMLR, 6628-- 6637 . Di Wang and Jinhui Xu. 2019. On Sparse Linear Regression in the Local Differential Privacy Model. In ICML (Proceedings of Machine Learning Research, Vol. 97). PMLR, 6628--6637."},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3040406"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.5555\/3367471.3367561"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"crossref","unstructured":"Lingxiao Wang and Quanquan Gu. 2020. A Knowledge Transfer Framework for Differentially Private Sparse Learning.. In AAAI. 6235--6242.  Lingxiao Wang and Quanquan Gu. 2020. A Knowledge Transfer Framework for Differentially Private Sparse Learning.. In AAAI. 6235--6242.","DOI":"10.1609\/aaai.v34i04.6090"},{"key":"e_1_3_2_2_56_1","volume-title":"Statistical methods for the analysis of biomedical data","author":"Woolson Robert F","unstructured":"Robert F Woolson and William R Clarke . 2011. Statistical methods for the analysis of biomedical data . Vol. 371 . John Wiley & Sons . Robert F Woolson and William R Clarke. 2011. Statistical methods for the analysis of biomedical data. Vol. 371. John Wiley & Sons."},{"key":"e_1_3_2_2_57_1","unstructured":"Lijun Zhang and Zhi-Hua Zhou. 2018. l1-regression with Heavy-tailed Distributions. In Advances in Neural Information Processing Systems. 1076--1086.  Lijun Zhang and Zhi-Hua Zhou. 2018. l1-regression with Heavy-tailed Distributions. In Advances in Neural Information Processing Systems. 1076--1086."},{"key":"e_1_3_2_2_58_1","volume-title":"Zhiwei Steven Wu, and Arindam Banerjee","author":"Zhou Yingxue","year":"2020","unstructured":"Yingxue Zhou , Zhiwei Steven Wu, and Arindam Banerjee . 2020 . Bypassing the ambient dimension: Private sgd with gradient subspace identification. arXiv preprint arXiv:2007.03813 (2020). Yingxue Zhou, Zhiwei Steven Wu, and Arindam Banerjee. 2020. Bypassing the ambient dimension: Private sgd with gradient subspace identification. arXiv preprint arXiv:2007.03813 (2020)."}],"event":{"name":"SIGMOD\/PODS '22: International Conference on Management of Data","location":"Philadelphia PA USA","acronym":"SIGMOD\/PODS '22","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3517804.3524144","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3517804.3524144","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:04Z","timestamp":1750182544000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3517804.3524144"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,12]]},"references-count":58,"alternative-id":["10.1145\/3517804.3524144","10.1145\/3517804"],"URL":"https:\/\/doi.org\/10.1145\/3517804.3524144","relation":{},"subject":[],"published":{"date-parts":[[2022,6,12]]},"assertion":[{"value":"2022-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}