{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T22:09:54Z","timestamp":1764886194805,"version":"3.46.0"},"publisher-location":"Cham","reference-count":110,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032122896","type":"print"},{"value":"9783032122902","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T00:00:00Z","timestamp":1764892800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T00:00:00Z","timestamp":1764892800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-12290-2_11","type":"book-chapter","created":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T22:06:59Z","timestamp":1764886019000},"page":"321-355","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Differentially Private Learning Beyond the\u00a0Classical Dimensionality Regime"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7177-3738","authenticated-orcid":false,"given":"Cynthia","family":"Dwork","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4424-0853","authenticated-orcid":false,"given":"Pranay","family":"Tankala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8309-7164","authenticated-orcid":false,"given":"Linjun","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,5]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., et al.: Deep learning with differential privacy. In: ACM Conference on Computer and Communications Security (CCS) (2016)","DOI":"10.1145\/2976749.2978318"},{"key":"11_CR2","unstructured":"Abbasi, E., Salehi, F., Hassibi, B.: Universality in learning from linear measurements. In: Conference on Neural Information Processing Systems (NeurIPS) (2019)"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Abdalla, P., Zhivotovskiy, N.: Covariance estimation: optimal dimension-free guarantees for adversarial corruption and heavy tails. J. Eur. Math. Soc. (2024)","DOI":"10.4171\/jems\/1505"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Agarwal, S., Kamath, G., Majid, M., Mouzakis, A., Silver, R., Ullman, J.: Private mean estimation with person-level differential privacy. In: ACM-SIAM Symposium on Discrete Algorithms (SODA) (2024)","DOI":"10.1137\/1.9781611978322.92"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Alabi, D., Kothari, P.K., Tankala, P., Venkat, P., Zhang, F.: Privately estimating a gaussian: efficient, robust, and optimal. In: ACM Symposium on Theory of Computing (STOC) (2023)","DOI":"10.1145\/3564246.3585194"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Amelunxen, D., Lotz, M., McCoy, M.B., Tropp, J.A.: Living on the edge: phase transitions in convex programs with random data. Inf. Inference J. IMA 3(3), 224\u2013294 (2014)","DOI":"10.1093\/imaiai\/iau005"},{"key":"11_CR7","unstructured":"Amin, K., Joseph, M., Ribero, M., Vassilvitskii, S.: Easy differentially private linear regression. In: International Conference on Learning Representations (ICLR) (2023)"},{"key":"11_CR8","unstructured":"Ashtiani, H., Liaw, C.: Private and polynomial time algorithms for learning gaussians and beyond. In: Conference on Learning Theory (COLT) (2022)"},{"key":"11_CR9","unstructured":"Balle, B., Wang, Y.: Improving the gaussian mechanism for differential privacy: analytical calibration and optimal denoising. In: International Conference on Machine Learning (ICML) (2018)"},{"key":"11_CR10","unstructured":"Bao, Z., Han, Q., Xu, X.: A leave-one-out approach to approximate message passing (2023)"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Bassily, R., Smith, A.D., Thakurta, A.: Private empirical risk minimization: efficient algorithms and tight error bounds. In: IEEE Symposium on Foundations of Computer Science (FOCS) (2014)","DOI":"10.1109\/FOCS.2014.56"},{"issue":"2","key":"11_CR12","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1214\/14-AAP1010","volume":"25","author":"M Bayati","year":"2015","unstructured":"Bayati, M., Lelarge, M., Montanari, A.: Universality in polytope phase transitions and message passing algorithms. Ann. Appl. Probab. 25(2), 753\u2013822 (2015)","journal-title":"Ann. Appl. Probab."},{"issue":"2","key":"11_CR13","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1109\/TIT.2010.2094817","volume":"57","author":"M Bayati","year":"2011","unstructured":"Bayati, M., Montanari, A.: The dynamics of message passing on dense graphs, with applications to compressed sensing. IEEE Trans. Inf. Theory 57(2), 764\u2013785 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"11_CR14","doi-asserted-by":"publisher","first-page":"1997","DOI":"10.1109\/TIT.2011.2174612","volume":"58","author":"M Bayati","year":"2011","unstructured":"Bayati, M., Montanari, A.: The lasso risk for gaussian matrices. IEEE Trans. Inf. Theory 58(4), 1997\u20132017 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"36","key":"11_CR15","doi-asserted-by":"publisher","first-page":"14563","DOI":"10.1073\/pnas.1307845110","volume":"110","author":"D Bean","year":"2013","unstructured":"Bean, D., Bickel, P.J., El Karoui, N., Yu, B.: Optimal m-estimation in high-dimensional regression. Proc. Natl. Acad. Sci. 110(36), 14563\u201314568 (2013)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"32","key":"11_CR16","doi-asserted-by":"publisher","first-page":"15849","DOI":"10.1073\/pnas.1903070116","volume":"116","author":"M Belkin","year":"2019","unstructured":"Belkin, M., Hsu, D., Ma, S., Mandal, S.: Reconciling modern machine-learning practice and the classical bias\u2013variance trade-off. Proc. Natl. Acad. Sci. 116(32), 15849\u201315854 (2019)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"4","key":"11_CR17","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1137\/20M1336072","volume":"2","author":"M Belkin","year":"2020","unstructured":"Belkin, M., Hsu, D., Xu, J.: Two models of double descent for weak features. SIAM J. Math. Data Sci. 2(4), 1167\u20131180 (2020)","journal-title":"SIAM J. Math. Data Sci."},{"issue":"15","key":"11_CR18","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2423072122","volume":"122","author":"S Bombari","year":"2025","unstructured":"Bombari, S., Mondelli, M.: Privacy for free in the overparameterized regime. Proc. Natl. Acad. Sci. 122(15), e2423072122 (2025)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"11_CR19","unstructured":"Bombari, S., Seroussi, I., Mondelli, M.: Better rates for private linear regression in the proportional regime via aggressive clipping. CoRR abs\/2505.16329 (2025)"},{"key":"11_CR20","unstructured":"Brown, G., et al.: Insufficient statistics perturbation: stable estimators for private least squares. In: Conference on Learning Theory (COLT) (2024)"},{"key":"11_CR21","unstructured":"Brown, G., Hopkins, S., Smith, A.: Fast, sample-efficient, affine-invariant private mean and covariance estimation for subgaussian distributions. In: Conference on Learning Theory (COLT) (2023)"},{"key":"11_CR22","unstructured":"Brown, G.R., Dvijotham, K.D., Evans, G., Liu, D., Smith, A., Guha\u00a0Thakurta, A.: Private gradient descent for linear regression: tighter error bounds and instance-specific uncertainty estimation. In: International Conference on Machine Learning (ICML) (2024)"},{"issue":"3\u20134","key":"11_CR23","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1561\/2200000050","volume":"8","author":"S Bubeck","year":"2015","unstructured":"Bubeck, S.: Convex optimization: algorithms and complexity. Found. Trends Mach. Learn. 8(3\u20134), 231\u2013357 (2015)","journal-title":"Found. Trends Mach. Learn."},{"key":"11_CR24","unstructured":"Bun, M., Kamath, G., Steinke, T., Wu, Z.S.: Private hypothesis selection. In: Conference on Neural Information Processing Systems (NeurIPS) (2019)"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Bun, M., Steinke, T.: Concentrated differential privacy: simplifications, extensions, and lower bounds. In: Hirt, M., Smith, A.D. (eds.) Theory of Cryptography Conference (TCC) (2016)","DOI":"10.1007\/978-3-662-53641-4_24"},{"issue":"5","key":"11_CR26","doi-asserted-by":"publisher","first-page":"2825","DOI":"10.1214\/21-AOS2058","volume":"49","author":"TT Cai","year":"2021","unstructured":"Cai, T.T., Wang, Y., Zhang, L.: The cost of privacy: optimal rates of convergence for parameter estimation with differential privacy. Ann. Stat. 49(5), 2825\u20132850 (2021)","journal-title":"Ann. Stat."},{"key":"11_CR27","unstructured":"Cai, T.T., Wang, Y., Zhang, L.: Score attack: a lower bound technique for optimal differentially private learning (2023)"},{"issue":"1","key":"11_CR28","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1214\/18-AOS1789","volume":"48","author":"EJ Cand\u00e8s","year":"2020","unstructured":"Cand\u00e8s, E.J., Sur, P.: The phase transition for the existence of the maximum likelihood estimate in high-dimensional logistic regression. Ann. Stat. 48(1), 27\u201342 (2020)","journal-title":"Ann. Stat."},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Canonne, C.L., Kamath, G., McMillan, A., Smith, A., Ullman, J.: The structure of optimal private tests for simple hypotheses. In: ACM Symposium on Theory of Computing (STOC) (2019)","DOI":"10.1145\/3313276.3316336"},{"issue":"5","key":"11_CR30","doi-asserted-by":"publisher","first-page":"2194","DOI":"10.1214\/23-AOS2327","volume":"51","author":"M Celentano","year":"2023","unstructured":"Celentano, M., Montanari, A., Wei, Y.: The Lasso with general Gaussian designs with applications to hypothesis testing. Ann. Stat. 51(5), 2194\u20132220 (2023)","journal-title":"Ann. Stat."},{"key":"11_CR31","unstructured":"Celentano, M., Montanari, A., Wu, Y.: The estimation error of general first order methods. In: Conference on Learning Theory (COLT) (2020)"},{"issue":"29","key":"11_CR32","first-page":"1069","volume":"12","author":"K Chaudhuri","year":"2011","unstructured":"Chaudhuri, K., Monteleoni, C., Sarwate, A.D.: Differentially private empirical risk minimization. J. Mach. Learn. Res. 12(29), 1069\u20131109 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"11_CR33","doi-asserted-by":"crossref","unstructured":"Dagan, Y., Jordan, M.I., Yang, X., Zakynthinou, L., Zhivotovskiy, N.: Dimension-free private mean estimation for anisotropic distributions. In: Neural Information Processing Systems (NeurIPS) (2024)","DOI":"10.52202\/079017-3835"},{"key":"11_CR34","doi-asserted-by":"crossref","unstructured":"Deng, Z., Kammoun, A., Thrampoulidis, C.: A model of double descent for high-dimensional binary linear classification. Inf. Inference J. IMA 11(2), 435\u2013495 (2021)","DOI":"10.1093\/imaiai\/iaab002"},{"key":"11_CR35","unstructured":"Dhifallah, O., Lu, Y.M.: A precise performance analysis of learning with random features (2020)"},{"issue":"45","key":"11_CR36","doi-asserted-by":"publisher","first-page":"18914","DOI":"10.1073\/pnas.0909892106","volume":"106","author":"DL Donoho","year":"2009","unstructured":"Donoho, D.L., Maleki, A., Montanari, A.: Message-passing algorithms for compressed sensing. Proc. Natl. Acad. Sci. 106(45), 18914\u201318919 (2009)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"10","key":"11_CR37","doi-asserted-by":"publisher","first-page":"6920","DOI":"10.1109\/TIT.2011.2165823","volume":"57","author":"DL Donoho","year":"2011","unstructured":"Donoho, D.L., Maleki, A., Montanari, A.: The noise-sensitivity phase transition in compressed sensing. IEEE Trans. Inf. Theory 57(10), 6920\u20136941 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"11_CR38","doi-asserted-by":"publisher","first-page":"1616","DOI":"10.1214\/23-AOP1628","volume":"51","author":"R Dudeja","year":"2023","unstructured":"Dudeja, R., Lu, Y.M., Sen, S.: Universality of approximate message passing with semirandom matrices. Ann. Probab. 51(5), 1616\u20131683 (2023)","journal-title":"Ann. Probab."},{"issue":"11","key":"11_CR39","doi-asserted-by":"publisher","first-page":"7923","DOI":"10.1109\/TIT.2024.3458953","volume":"70","author":"R Dudeja","year":"2024","unstructured":"Dudeja, R., Sen, S., Lu, Y.M.: Spectral universality in regularized linear regression with nearly deterministic sensing matrices. IEEE Trans. Inf. Theory 70(11), 7923\u20137951 (2024)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR40","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., Naor, M.: Our data, ourselves: privacy via distributed noise generation. In: International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT) (2006)","DOI":"10.1007\/11761679_29"},{"key":"11_CR41","doi-asserted-by":"crossref","unstructured":"Dwork, C., Lei, J.: Differential privacy and robust statistics. In: ACM Symposium on Theory of Computing (STOC) (2009)","DOI":"10.1145\/1536414.1536466"},{"key":"11_CR42","doi-asserted-by":"crossref","unstructured":"Dwork, C., McSherry, F., Nissim, K., Smith, A.D.: Calibrating noise to sensitivity in private data analysis. In: Theory of Cryptography Conference (TCC) (2006)","DOI":"10.1007\/11681878_14"},{"issue":"3\u20134","key":"11_CR43","first-page":"211","volume":"9","author":"C Dwork","year":"2014","unstructured":"Dwork, C., Roth, A.: The algorithmic foundations of differential privacy. Found. Trends Theor. Comput. Sci. 9(3\u20134), 211\u2013407 (2014)","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"11_CR44","unstructured":"Dwork, C., Rothblum, G.N.: Concentrated differential privacy (2016)"},{"key":"11_CR45","unstructured":"El\u00a0Karoui, N.: Asymptotic behavior of unregularized and ridge-regularized high-dimensional robust regression estimators: rigorous results (2013)"},{"key":"11_CR46","doi-asserted-by":"crossref","unstructured":"El\u00a0Karoui, N.: On the impact of predictor geometry on the performance on high-dimensional ridge-regularized generalized robust regression estimators. Probab. Theory Related Fields 170(1), 95\u2013175 (2018)","DOI":"10.1007\/s00440-016-0754-9"},{"issue":"77","key":"11_CR47","first-page":"1","volume":"20","author":"Y Fan","year":"2019","unstructured":"Fan, Y., Demirkaya, E., Lv, J.: Nonuniformity of p-values can occur early in diverging dimensions. J. Mach. Learn. Res. 20(77), 1\u201333 (2019)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"11_CR48","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1214\/21-AOS2101","volume":"50","author":"Z Fan","year":"2022","unstructured":"Fan, Z.: Approximate message passing algorithms for rotationally invariant matrices. Ann. Stat. 50(1), 197\u2013224 (2022)","journal-title":"Ann. Stat."},{"key":"11_CR49","unstructured":"Georgiev, K., Hopkins, S.B.: Privacy induces robustness: information-computation gaps and sparse mean estimation. In: Conference on Neural Information Processing Systems (NeurIPS) (2024)"},{"issue":"2","key":"11_CR50","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1137\/23M1594388","volume":"6","author":"C Gerbelot","year":"2024","unstructured":"Gerbelot, C., Troiani, E., Mignacco, F., Krzakala, F., Zdeborov\u00e1, L.: Rigorous dynamical mean-field theory for stochastic gradient descent methods. SIAM J. Math. Data Sci. 6(2), 400\u2013427 (2024)","journal-title":"SIAM J. Math. Data Sci."},{"key":"11_CR51","unstructured":"Gopi, S., Kamath, G., Kulkarni, J., Nikolov, A., Wu, Z.S., Zhang, H.: Locally private hypothesis selection. In: Conference on Learning Theory (COLT) (2020)"},{"key":"11_CR52","doi-asserted-by":"crossref","unstructured":"Gordon, Y.: Some inequalities for gaussian processes and applications. Israel J. Math. 50(4), 265\u2013289 (1985)","DOI":"10.1007\/BF02759761"},{"key":"11_CR53","doi-asserted-by":"crossref","unstructured":"Han, Q.: Entrywise dynamics and universality of general first order methods (2024)","DOI":"10.1214\/25-AOS2544"},{"issue":"4","key":"11_CR54","doi-asserted-by":"publisher","first-page":"1799","DOI":"10.1214\/23-AOS2309","volume":"51","author":"Q Han","year":"2023","unstructured":"Han, Q., Shen, Y.: Universality of regularized regression estimators in high dimensions. Ann. Stat. 51(4), 1799\u20131823 (2023)","journal-title":"Ann. Stat."},{"key":"11_CR55","doi-asserted-by":"crossref","unstructured":"Hopkins, S.B., Kamath, G., Majid, M.: Efficient mean estimation with pure differential privacy via a sum-of-squares exponential mechanism. In: ACM Symposium on Theory of Computing (STOC) (2022)","DOI":"10.1145\/3519935.3519947"},{"key":"11_CR56","doi-asserted-by":"crossref","unstructured":"Hopkins, S.B., Kamath, G., Majid, M., Narayanan, S.: Robustness implies privacy in statistical estimation. In: ACM Symposium on Theory of Computing (STOC) (2023)","DOI":"10.1145\/3564246.3585115"},{"issue":"11","key":"11_CR57","doi-asserted-by":"publisher","first-page":"7627","DOI":"10.1109\/TIT.2022.3188753","volume":"68","author":"H Hu","year":"2022","unstructured":"Hu, H., Lu, Y.M.: Slope for sparse linear regression: asymptotics and optimal regularization. IEEE Trans. Inf. Theory 68(11), 7627\u20137664 (2022)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"11_CR58","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1214\/aoms\/1177703732","volume":"35","author":"PJ Huber","year":"1964","unstructured":"Huber, P.J.: Robust estimation of a location parameter. Ann. Math. Stat. 35(1), 73\u2013101 (1964)","journal-title":"Ann. Math. Stat."},{"key":"11_CR59","doi-asserted-by":"crossref","unstructured":"Iyengar, R., Near, J.P., Song, D., Thakkar, O., Thakurta, A., Wang, L.: Towards practical differentially private convex optimization. In: IEEE Symposium on Security and Privacy (2019)","DOI":"10.1109\/SP.2019.00001"},{"key":"11_CR60","unstructured":"Jain, P., Thakurta, A.G.: (near) dimension independent risk bounds for differentially private learning. In: International Conference on Machine Learning (ICML) (2014)"},{"key":"11_CR61","unstructured":"Kamath, G., Li, J., Singhal, V., Ullman, J.: Privately learning high-dimensional distributions. In: Conference on Learning Theory (COLT) (2019)"},{"key":"11_CR62","unstructured":"Kamath, G., Mouzakis, A., Singhal, V., Steinke, T., Ullman, J.: A private and computationally-efficient estimator for unbounded gaussians. In: Proceedings of Thirty Fifth Conference on Learning Theory (COLT) (2022)"},{"key":"11_CR63","unstructured":"Kamath, G., Singhal, V., Ullman, J.: Private mean estimation of heavy-tailed distributions. In: Conference on Learning Theory (COLT) (2020)"},{"key":"11_CR64","unstructured":"Kent, A., Berrett, T.B., Yu, Y.: Rate optimality and phase transition for user-level local differential privacy (2024)"},{"key":"11_CR65","unstructured":"Kifer, D., Smith, A., Thakurta, A.: Private convex empirical risk minimization and high-dimensional regression. In: Conference on Learning Theory (COLT) (2012)"},{"issue":"4","key":"11_CR66","doi-asserted-by":"publisher","first-page":"2440","DOI":"10.1109\/TIT.2011.2112231","volume":"57","author":"SB Korada","year":"2011","unstructured":"Korada, S.B., Montanari, A.: Applications of the lindeberg principle in communications and statistical learning. IEEE Trans. Inf. Theory 57(4), 2440\u20132450 (2011). https:\/\/doi.org\/10.1109\/TIT.2011.2112231","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR67","unstructured":"Kothari, P., Manurangsi, P., Velingker, A.: Private robust estimation by stabilizing convex relaxations. In: Conference on Learning Theory (COLT) (2022)"},{"key":"11_CR68","unstructured":"Kuditipudi, R., Duchi, J., Haque, S.: A pretty fast algorithm for adaptive private mean estimation. In: Conference on Learning Theory (COLT) (2023)"},{"issue":"3","key":"11_CR69","doi-asserted-by":"publisher","first-page":"1669","DOI":"10.1214\/22-AOS2170","volume":"50","author":"T Liang","year":"2022","unstructured":"Liang, T., Sur, P.: A precise high-dimensional asymptotic theory for boosting and minimum-$${\\ell _{1}}$$-norm interpolated classifiers. Ann. Stat. 50(3), 1669\u20131695 (2022)","journal-title":"Ann. Stat."},{"key":"11_CR70","unstructured":"Liu, X., Kong, W., Kakade, S.M., Oh, S.: Robust and differentially private mean estimation. In: Conference on Neural Information Processing Systems (NeurIPS) (2021)"},{"key":"11_CR71","unstructured":"Liu, X., Kong, W., Oh, S.: Differential privacy and robust statistics in high dimensions. In: Conference on Learning Theory (COLT) (2022)"},{"key":"11_CR72","doi-asserted-by":"crossref","unstructured":"Loureiro, B., et al.: Learning curves of generic features maps for realistic datasets with a teacher-student model. In: Conference on Neural Information Processing Systems (NeurIPS) (2021)","DOI":"10.1088\/1742-5468\/ac9825"},{"key":"11_CR73","unstructured":"Ma, Y., Jia, K., Yang, H.: Better locally private sparse estimation given multiple samples per user. In: International Conference on Machine Learning (ICML) (2024)"},{"issue":"4","key":"11_CR74","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1002\/cpa.22008","volume":"75","author":"S Mei","year":"2022","unstructured":"Mei, S., Montanari, A.: The generalization error of random features regression: precise asymptotics and the double descent curve. Commun. Pure Appl. Math. 75(4), 667\u2013766 (2022)","journal-title":"Commun. Pure Appl. Math."},{"issue":"1\u20132","key":"11_CR75","doi-asserted-by":"publisher","first-page":"33","DOI":"10.4171\/MSL\/48","volume":"8","author":"A Minasyan","year":"2025","unstructured":"Minasyan, A., Zhivotovskiy, N.: Statistically optimal robust mean and covariance estimation for anisotropic gaussians. Math. Stat. Learn. 8(1\u20132), 33\u201369 (2025). https:\/\/doi.org\/10.4171\/MSL\/48","journal-title":"Math. Stat. Learn."},{"issue":"4","key":"11_CR76","doi-asserted-by":"publisher","first-page":"2313","DOI":"10.1214\/20-AOS2038","volume":"49","author":"L Miolane","year":"2021","unstructured":"Miolane, L., Montanari, A.: The distribution of the Lasso: uniform control over sparse balls and adaptive parameter tuning. Ann. Stat. 49(4), 2313\u20132335 (2021)","journal-title":"Ann. Stat."},{"key":"11_CR77","unstructured":"Mir, D.J.: Differential privacy: an exploration of the privacy-utility landscape. Ph.D. thesis, Rutgers University (2013)"},{"key":"11_CR78","doi-asserted-by":"crossref","unstructured":"Mironov, I.: R\u00e9nyi differential privacy. In: IEEE Computer Security Foundations Symposium (CSF) (2017)","DOI":"10.1109\/CSF.2017.11"},{"key":"11_CR79","doi-asserted-by":"publisher","unstructured":"Montanari, A., Nguyen, P.M.: Universality of the elastic net error. In: 2017 IEEE International Symposium on Information Theory (ISIT), pp. 2338\u20132342 (2017). https:\/\/doi.org\/10.1109\/ISIT.2017.8006947","DOI":"10.1109\/ISIT.2017.8006947"},{"key":"11_CR80","unstructured":"Montanari, A., Ruan, F., Sohn, Y., Yan, J.: The generalization error of max-margin linear classifiers: benign overfitting and high dimensional asymptotics in the overparametrized regime (2023)"},{"key":"11_CR81","unstructured":"Narayanan, S.: Private high-dimensional hypothesis testing. In: Conference on Learning Theory (COLT) (2022)"},{"key":"11_CR82","unstructured":"Neel, S., Roth, A., Vietri, G., Wu, Z.S.: Oracle efficient private non-convex optimization. In: International Conference on Machine Learning (ICML) (2020)"},{"key":"11_CR83","doi-asserted-by":"crossref","unstructured":"Oymak, S., Tropp, J.A.: Universality laws for randomized dimension reduction, with applications. Inf. Inference J. IMA 7(3), 337\u2013446 (2017)","DOI":"10.1093\/imaiai\/iax011"},{"key":"11_CR84","unstructured":"Panahi, A., Hassibi, B.: A universal analysis of large-scale regularized least squares solutions. In: Conference on Neural Information Processing Systems (NeurIPS) (2017)"},{"issue":"3","key":"11_CR85","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S.P.: Proximal algorithms. Found. Trends Optim. 1(3), 127\u2013239 (2014)","journal-title":"Found. Trends Optim."},{"key":"11_CR86","unstructured":"Pour, A.F., Ashtiani, H., Asoodeh, S.: Sample-optimal locally private hypothesis selection and the provable benefits of interactivity. In: Conference on Learning Theory (COLT) (2024)"},{"key":"11_CR87","unstructured":"Redberg, R., Koskela, A., Wang, Y.: Improving the privacy and practicality of objective perturbation for differentially private linear learners. In: Conference on Neural Information Processing Systems (NeurIPS) (2023)"},{"key":"11_CR88","unstructured":"Redberg, R., Wang, Y.: Privately publishable per-instance privacy. In: Conference on Neural Information Processing Systems (NeurIPS) (2021)"},{"key":"11_CR89","unstructured":"Salehi, F., Abbasi, E., Hassibi, B.: The impact of regularization on high-dimensional logistic regression. In: Conference on Neural Information Processing Systems (NeurIPS) (2019)"},{"key":"11_CR90","unstructured":"Sheffet, O.: Differentially private ordinary least squares. In: International Conference on Machine Learning (ICML) (2017)"},{"key":"11_CR91","unstructured":"Sheffet, O.: Old techniques in differentially private linear regression. In: International Conference on Algorithmic Learning Theory (2019)"},{"issue":"1","key":"11_CR92","doi-asserted-by":"publisher","first-page":"171","DOI":"10.2140\/pjm.1958.8.171","volume":"8","author":"M Sion","year":"1958","unstructured":"Sion, M.: On general minimax theorems. Pac. J. Math. 8(1), 171\u2013176 (1958)","journal-title":"Pac. J. Math."},{"issue":"2","key":"11_CR93","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1002\/j.1538-7305.1962.tb02419.x","volume":"41","author":"D Slepian","year":"1962","unstructured":"Slepian, D.: The one-sided barrier problem for gaussian noise. Bell Syst. Tech. J. 41(2), 463\u2013501 (1962). https:\/\/doi.org\/10.1002\/j.1538-7305.1962.tb02419.x","journal-title":"Bell Syst. Tech. J."},{"key":"11_CR94","doi-asserted-by":"crossref","unstructured":"Song, S., Chaudhuri, K., Sarwate, A.D.: Stochastic gradient descent with differentially private updates. In: IEEE Global Conference on Signal and Information Processing (GlobalSIP) (2013)","DOI":"10.1109\/GlobalSIP.2013.6736861"},{"key":"11_CR95","doi-asserted-by":"crossref","unstructured":"Steinke, T., Ullman, J.R.: Tight lower bounds for differentially private selection. In: IEEE Symposium on Foundations of Computer Science (FOCS) (2017)","DOI":"10.1109\/FOCS.2017.57"},{"key":"11_CR96","unstructured":"Stojnic, M.: A framework to characterize performance of lasso algorithms (2013)"},{"issue":"29","key":"11_CR97","doi-asserted-by":"publisher","first-page":"14516","DOI":"10.1073\/pnas.1810420116","volume":"116","author":"P Sur","year":"2019","unstructured":"Sur, P., Cand\u00e8s, E.J.: A modern maximum-likelihood theory for high-dimensional logistic regression. Proc. Natl. Acad. Sci. 116(29), 14516\u201314525 (2019)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"8","key":"11_CR98","doi-asserted-by":"publisher","first-page":"5592","DOI":"10.1109\/TIT.2018.2840720","volume":"64","author":"C Thrampoulidis","year":"2018","unstructured":"Thrampoulidis, C., Abbasi, E., Hassibi, B.: Precise error analysis of regularized m-estimators in high dimensions. IEEE Trans. Inf. Theory 64(8), 5592\u20135628 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR99","unstructured":"Thrampoulidis, C., Oymak, S., Hassibi, B.: Regularized linear regression: a precise analysis of the estimation error. In: Conference on Learning Theory (COLT) (2015)"},{"key":"11_CR100","doi-asserted-by":"crossref","unstructured":"Vadhan, S.P.: The complexity of differential privacy. In: Lindell, Y. (ed.) Tutorials on the Foundations of Cryptography, pp. 347\u2013450. Springer (2017)","DOI":"10.1007\/978-3-319-57048-8_7"},{"key":"11_CR101","unstructured":"Varshney, P., Thakurta, A., Jain, P.: (nearly) optimal private linear regression for sub-gaussian data via adaptive clipping. In: Conference on Learning Theory (COLT) (2022)"},{"key":"11_CR102","doi-asserted-by":"crossref","unstructured":"Vershynin, R.: High-Dimensional Probability: An Introduction with Applications in Data Science. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press (2018)","DOI":"10.1017\/9781108231596"},{"key":"11_CR103","doi-asserted-by":"crossref","unstructured":"Wainwright, M.J.: High-Dimensional Statistics: A Non-Asymptotic Viewpoint. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press (2019)","DOI":"10.1017\/9781108627771"},{"key":"11_CR104","doi-asserted-by":"crossref","unstructured":"Wang, S., Weng, H., Maleki, A.: Does SLOPE outperform bridge regression? Inf. Inference J. IMA 11(1), 1\u201354 (2021)","DOI":"10.1093\/imaiai\/iaab025"},{"issue":"4","key":"11_CR105","doi-asserted-by":"publisher","first-page":"3943","DOI":"10.1214\/24-AAP2056","volume":"34","author":"T Wang","year":"2024","unstructured":"Wang, T., Zhong, X., Fan, Z.: Universality of approximate message passing algorithms and tensor networks. Ann. Appl. Probab. 34(4), 3943\u20133994 (2024)","journal-title":"Ann. Appl. Probab."},{"key":"11_CR106","unstructured":"Wang, Y.: Revisiting differentially private linear regression: optimal and adaptive prediction & estimation in unbounded domain. In: Conference on Uncertainty in Artificial Intelligence (UAI) (2018)"},{"key":"11_CR107","unstructured":"Wang, Y.X., Fienberg, S., Smola, A.: Privacy for free: posterior sampling and stochastic gradient Monte Carlo. In: International Conference on Machine Learning (ICML) (2015)"},{"key":"11_CR108","unstructured":"Zhang, X., Zhou, H., Ye, H.: A modern theory for high-dimensional cox regression models (2022)"},{"issue":"3","key":"11_CR109","doi-asserted-by":"publisher","first-page":"1835","DOI":"10.3150\/21-BEJ1401","volume":"28","author":"Q Zhao","year":"2022","unstructured":"Zhao, Q., Sur, P., Cand\u00e8s, E.J.: The asymptotic distribution of the MLE in high-dimensional logistic models: arbitrary covariance. Bernoulli 28(3), 1835\u20131861 (2022)","journal-title":"Bernoulli"},{"key":"11_CR110","doi-asserted-by":"crossref","unstructured":"Zhou, M., Wang, T., Chan, T.H.H., Fanti, G., Shi, E.: Locally differentially private sparse vector aggregation. In: IEEE Symposium on Security and Privacy (2022)","DOI":"10.1109\/SP46214.2022.9833635"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-12290-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T22:07:09Z","timestamp":1764886029000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-12290-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,5]]},"ISBN":["9783032122896","9783032122902"],"references-count":110,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-12290-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,5]]},"assertion":[{"value":"5 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aarhus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}