{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T15:48:49Z","timestamp":1780674529780,"version":"3.54.1"},"reference-count":76,"publisher":"Springer Science and Business Media LLC","issue":"11-12","license":[{"start":{"date-parts":[[2024,9,26]],"date-time":"2024-09-26T00:00:00Z","timestamp":1727308800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,26]],"date-time":"2024-09-26T00:00:00Z","timestamp":1727308800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12301384"],"award-info":[{"award-number":["12301384"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72122018"],"award-info":[{"award-number":["72122018"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007128","name":"Natural Science Foundation of Shaanxi Province","doi-asserted-by":"publisher","award":["2021JQ-429"],"award-info":[{"award-number":["2021JQ-429"]}],"id":[{"id":"10.13039\/501100007128","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007128","name":"Natural Science Foundation of Shaanxi Province","doi-asserted-by":"publisher","award":["2021JC-01"],"award-info":[{"award-number":["2021JC-01"]}],"id":[{"id":"10.13039\/501100007128","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10994-024-06620-0","type":"journal-article","created":{"date-parts":[[2024,9,26]],"date-time":"2024-09-26T15:02:04Z","timestamp":1727362924000},"page":"8427-8458","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Fedpower: privacy-preserving distributed eigenspace estimation"],"prefix":"10.1007","volume":"113","author":[{"given":"Xiao","family":"Guo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiang","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiangyu","family":"Chang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shusen","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhihua","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,9,26]]},"reference":[{"key":"6620_CR1","unstructured":"Amin, K., Dick, T., Kulesza, A., Munoz, A., & Vassilvitskii, S. (2019). Differentially private covariance estimation. Advances in Neural Information Processing Systems,32."},{"key":"6620_CR2","unstructured":"Ammad-Ud-Din, M., Ivannikova, E., Khan, S. A., Oyomno, W., Fu, Q., Tan, K. E., & Flanagan, A. (2019). Federated collaborative filtering for privacy-preserving personalized recommendation system. arXiv preprint arXiv:1901.09888"},{"issue":"3","key":"6620_CR3","first-page":"377","volume":"2","author":"P Arbenz","year":"2012","unstructured":"Arbenz, P., Kressner, D., & Z\u00fcrich, D. (2012). Lecture notes on solving large scale eigenvalue problems. D-MATH, EHT Zurich, 2(3), 377.","journal-title":"D-MATH, EHT Zurich"},{"issue":"1","key":"6620_CR4","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.jeconom.2013.03.007","volume":"176","author":"J Bai","year":"2013","unstructured":"Bai, J., & Ng, S. (2013). Principal components estimation and identification of static factors. Journal of Econometrics, 176(1), 18\u201329.","journal-title":"Journal of Econometrics"},{"key":"6620_CR5","unstructured":"Balcan, M. -F., Du, S. S., Wang, Y., & Yu, A. W. (2016). An improved gap-dependency analysis of the noisy power method. In Conference on Learning Theory (pp. 284\u2013309). PMLR."},{"key":"6620_CR6","unstructured":"Balle, B., Barthe, G., & Gaboardi, M. (2018). Privacy amplification by subsampling: Tight analyses via couplings and divergences. Advances in Neural Information Processing Systems,31."},{"key":"6620_CR7","unstructured":"Bhaskara, A., & Wijewardena, P. M. (2019). On distributed averaging for stochastic k-PCA. Advances in Neural Information Processing Systems,32."},{"key":"6620_CR8","doi-asserted-by":"crossref","unstructured":"Bun, M., Dwork, C., Rothblum, G. N., & Steinke, T. (2018). Composable and versatile privacy via truncated CDP. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (pp. 74\u201386).","DOI":"10.1145\/3188745.3188946"},{"key":"6620_CR9","unstructured":"Cai, T.T., Xia, D., & Zha, M. (2024). Optimal differentially private PCA and estimation for spiked covariance matrices. arXiv preprint arXiv:2401.03820"},{"issue":"3\u20134","key":"6620_CR10","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/s00440-014-0562-z","volume":"161","author":"T Cai","year":"2015","unstructured":"Cai, T., Ma, Z., & Wu, Y. (2015). Optimal estimation and rank detection for sparse spiked covariance matrices. Probability Theory and Related Fields, 161(3\u20134), 781\u2013815.","journal-title":"Probability Theory and Related Fields"},{"issue":"6","key":"6620_CR11","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1145\/2184319.2184343","volume":"55","author":"E Candes","year":"2012","unstructured":"Candes, E., & Recht, B. (2012). Exact matrix completion via convex optimization. Communications of the ACM, 55(6), 111\u2013119.","journal-title":"Communications of the ACM"},{"issue":"36","key":"6620_CR12","doi-asserted-by":"publisher","first-page":"158","DOI":"10.13001\/ela.2020.5009","volume":"36","author":"J Cape","year":"2020","unstructured":"Cape, J. (2020). Orthogonal procrustes and norm-dependent optimality. The Electronic Journal of Linear Algebra, 36(36), 158\u2013168.","journal-title":"The Electronic Journal of Linear Algebra"},{"key":"6620_CR13","doi-asserted-by":"crossref","unstructured":"Chai, D., Wang, L., Zhang, J., Yang, L., Cai, S., Chen, K., & Yang, Q. (2022). Practical lossless federated singular vector decomposition over billion-scale data. In Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (pp. 46\u201355).","DOI":"10.1145\/3534678.3539402"},{"issue":"5","key":"6620_CR14","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1109\/MIS.2020.3014880","volume":"36","author":"D Chai","year":"2020","unstructured":"Chai, D., Wang, L., Chen, K., & Yang, Q. (2020). Secure federated matrix factorization. IEEE Intelligent Systems, 36(5), 11\u201320.","journal-title":"IEEE Intelligent Systems"},{"issue":"4","key":"6620_CR15","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1137\/20M1364862","volume":"3","author":"V Charisopoulos","year":"2021","unstructured":"Charisopoulos, V., Benson, A. R., & Damle, A. (2021). Communication-efficient distributed eigenspace estimation. SIAM Journal on Mathematics of Data Science, 3(4), 1067\u20131092.","journal-title":"SIAM Journal on Mathematics of Data Science"},{"key":"6620_CR16","unstructured":"Chaudhuri, K., Sarwate, A. D., & Sinha, K. (2013). A near-optimal algorithm for differentially-private principal components. Journal of Machine Learning Research,14."},{"issue":"540","key":"6620_CR17","doi-asserted-by":"publisher","first-page":"1775","DOI":"10.1080\/01621459.2021.1886937","volume":"117","author":"X Chen","year":"2022","unstructured":"Chen, X., Lee, J. D., Li, H., & Yang, Y. (2022). Distributed estimation for principal component analysis: An enlarged eigenspace analysis. Journal of the American Statistical Association, 117(540), 1775\u20131786.","journal-title":"Journal of the American Statistical Association"},{"key":"6620_CR18","unstructured":"Dong, W., Liang, Y., & Yi, K. (2022). Differentially private covariance revisited. Advances in Neural Information Processing Systems,35."},{"issue":"1","key":"6620_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1111\/rssb.12454","volume":"84","author":"J Dong","year":"2022","unstructured":"Dong, J., Roth, A., & Su, W. J. (2022). Gaussian differential privacy. Journal of the Royal Statistical Society Series B: Statistical Methodology, 84(1), 3\u201337.","journal-title":"Journal of the Royal Statistical Society Series B: Statistical Methodology"},{"key":"6620_CR20","unstructured":"Dwork, C., & Rothblum, G. N. (2016). Concentrated differential privacy. arXiv preprint arXiv:1603.01887"},{"key":"6620_CR21","doi-asserted-by":"crossref","unstructured":"Dwork, C., McSherry, F., Nissim, K., & Smith, A. (2006). Calibrating noise to sensitivity in private data analysis. In Theory of Cryptography Conference (pp. 265\u2013284). Springer.","DOI":"10.1007\/11681878_14"},{"key":"6620_CR22","doi-asserted-by":"crossref","unstructured":"Dwork, C., Talwar, K., Thakurta, A., & Zhang, L. (2014). Analyze gauss: optimal bounds for privacy-preserving principal component analysis. In Proceedings of the Forty-sixth Annual ACM Symposium on Theory of Computing (pp. 11\u201320).","DOI":"10.1145\/2591796.2591883"},{"issue":"3\u20134","key":"6620_CR23","first-page":"211","volume":"9","author":"C Dwork","year":"2014","unstructured":"Dwork, C., Roth, A., et al. (2014). The algorithmic foundations of differential privacy. Foundations and Trends in Theoretical Computer Science, 9(3\u20134), 211\u2013407.","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"key":"6620_CR24","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1146\/annurev-statistics-060116-054123","volume":"4","author":"C Dwork","year":"2017","unstructured":"Dwork, C., Smith, A., Steinke, T., & Ullman, J. (2017). Exposed! a survey of attacks on private data. Annual Review of Statistics and Its Application, 4, 61\u201384.","journal-title":"Annual Review of Statistics and Its Application"},{"issue":"528","key":"6620_CR25","doi-asserted-by":"publisher","first-page":"1880","DOI":"10.1080\/01621459.2018.1527700","volume":"114","author":"J Fan","year":"2019","unstructured":"Fan, J., Ke, Y., Sun, Q., & Zhou, W.-X. (2019). Farmtest: Factor-adjusted robust multiple testing with approximate false discovery control. Journal of the American Statistical Association, 114(528), 1880\u20131893.","journal-title":"Journal of the American Statistical Association"},{"issue":"6","key":"6620_CR26","doi-asserted-by":"publisher","first-page":"3009","DOI":"10.1214\/18-AOS1713","volume":"47","author":"J Fan","year":"2019","unstructured":"Fan, J., Wang, D., Wang, K., & Zhu, Z. (2019). Distributed estimation of principal eigenspaces. Annals of Statistics, 47(6), 3009.","journal-title":"Annals of Statistics"},{"key":"6620_CR27","doi-asserted-by":"crossref","unstructured":"Gang, A., Raja, H., & Bajwa, W. U. (2019). Fast and communication-efficient distributed PCA. In ICASSP 2019-2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) (pp. 7450\u20137454). IEEE.","DOI":"10.1109\/ICASSP.2019.8683095"},{"key":"6620_CR28","doi-asserted-by":"publisher","first-page":"6080","DOI":"10.1109\/TSP.2022.3229635","volume":"70","author":"A Gang","year":"2022","unstructured":"Gang, A., & Bajwa, W. U. (2022). Fast-pca: A fast and exact algorithm for distributed principal component analysis. IEEE Transactions on Signal Processing, 70, 6080\u20136095.","journal-title":"IEEE Transactions on Signal Processing"},{"key":"6620_CR29","unstructured":"Garber, D., Shamir, O., & Srebro, N. (2017). Communication-efficient algorithms for distributed stochastic principal component analysis. In International Conference on Machine Learning (pp. 1203\u20131212). PMLR."},{"key":"6620_CR30","unstructured":"Ge, J., Wang, Z., Wang, M., & Liu, H. (2018). Minimax-optimal privacy-preserving sparse PCA in distributed systems. In International Conference on Artificial Intelligence and Statistics (pp. 1589\u20131598). PMLR."},{"issue":"1","key":"6620_CR31","first-page":"3977","volume":"17","author":"A Gittens","year":"2016","unstructured":"Gittens, A., & Mahoney, M. W. (2016). Revisiting the nystr\u00f6m method for improved large-scale machine learning. The Journal of Machine Learning Research, 17(1), 3977\u20134041.","journal-title":"The Journal of Machine Learning Research"},{"key":"6620_CR32","volume-title":"Foundations of Cryptography: Volume 2, Basic Applications","author":"O Goldreich","year":"2009","unstructured":"Goldreich, O. (2009). Foundations of Cryptography: Volume 2, Basic Applications. Cambridge University Press."},{"issue":"2","key":"6620_CR33","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1137\/0702016","volume":"2","author":"GH Golub","year":"1965","unstructured":"Golub, G. H., & Kahan, W. (1965). Calculating the singular values and pseudo-inverse of a matrix. Journal of the Society for Industrial and Applied Mathematics, Series B: Numerical Analysis, 2(2), 205\u2013224.","journal-title":"Journal of the Society for Industrial and Applied Mathematics, Series B: Numerical Analysis"},{"key":"6620_CR34","doi-asserted-by":"crossref","DOI":"10.56021\/9781421407944","volume-title":"Matrix Computations","author":"GH Golub","year":"2012","unstructured":"Golub, G. H., & Van Loan, C. F. (2012). Matrix Computations (Vol. 3). JHU Press."},{"key":"6620_CR35","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/BF02163027","volume":"14","author":"GH Golub","year":"1970","unstructured":"Golub, G. H., & Reinsch, C. (1970). Singular value decomposition and least squares solutions. Numerische Mathematik, 14, 403\u2013420.","journal-title":"Numerische Mathematik"},{"key":"6620_CR36","unstructured":"Grammenos, A., Mendoza Smith, R., Crowcroft, J., & Mascolo, C. (2020). Federated principal component analysis. Advances in Neural Information Processing Systems,33."},{"key":"6620_CR37","unstructured":"Hardt, M., & Price, E. (2014). The noisy power method: A meta algorithm with applications. Advances in neural information processing systems,27."},{"key":"6620_CR38","doi-asserted-by":"crossref","unstructured":"Hardt, M., & Roth, A. (2013). Beyond worst-case analysis in private singular vector computation. In Proceedings of the Forty-fifth Annual ACM Symposium on Theory of Computing (pp. 331\u2013340).","DOI":"10.1145\/2488608.2488650"},{"key":"6620_CR39","unstructured":"Huang, L. -K., & Pan, S. (2020). Communication-efficient distributed pca by riemannian optimization. In International Conference on Machine Learning (pp. 4465\u20134474). PMLR."},{"key":"6620_CR40","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-78189-1","volume-title":"Modern Multivariate Statistical Techniques","author":"AJ Izenman","year":"2008","unstructured":"Izenman, A. J. (2008). Modern Multivariate Statistical Techniques (Vol. 1). Berlin: Springer."},{"issue":"1\u20132","key":"6620_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000083","volume":"14","author":"P Kairouz","year":"2021","unstructured":"Kairouz, P., McMahan, H. B., Avent, B., Bellet, A., Bennis, M., Bhagoji, A. N., Bonawitz, K., Charles, Z., Cormode, G., Cummings, R., et al. (2021). Advances and open problems in federated learning. Foundations and Trends\u00ae in Machine Learning, 14(1\u20132), 1\u2013210.","journal-title":"Foundations and Trends\u00ae in Machine Learning"},{"key":"6620_CR42","unstructured":"Karimireddy, S. P., Kale, S., Mohri, M., Reddi, S., Stich, S., & Suresh, A. T. (2020). Scaffold: Stochastic controlled averaging for federated learning. In International Conference on Machine Learning (pp. 5132\u20135143). PMLR."},{"key":"6620_CR43","unstructured":"Khaled, A., Mishchenko, K., & Richt\u00e1rik, P. (2019). First analysis of local GD on heterogeneous data. arXiv preprint arXiv:1909.04715"},{"key":"6620_CR44","doi-asserted-by":"crossref","unstructured":"Lei, J., & Lin, K. Z. (2022). Bias-adjusted spectral clustering in multi-layer stochastic block models. Journal of the American Statistical Association, 1\u201313.","DOI":"10.1080\/01621459.2022.2054817"},{"key":"6620_CR45","unstructured":"Li, X., & Zhang, Z. (2021). Delayed projection techniques for linearly constrained problems: Convergence rates, acceleration, and applications. arXiv preprint arXiv:2101.01505"},{"key":"6620_CR46","unstructured":"Li, X., Huang, K., Yang, W., Wang, S., & Zhang, Z. (2020). On the convergence of FedAvg on non-iid data. In International Conference on Learning Representations."},{"key":"6620_CR47","unstructured":"Li, J., Khodak, M., Caldas, S., & Talwalkar, A. (2019). Differentially private meta-learning. arXiv preprint arXiv:1909.05830"},{"key":"6620_CR48","unstructured":"Li, X., Wang, S., Chen, K., & Zhang, Z. (2021). Communication-efficient distributed SVD via local power iterations. In International Conference on Machine Learning (pp. 6504\u20136514). PMLR."},{"key":"6620_CR49","unstructured":"Li, X., Yang, W., Wang, S., & Zhang, Z. (2019). Communication efficient decentralized training with multiple local updates. arXiv preprint arXiv:1910.09126"},{"issue":"3","key":"6620_CR50","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/MSP.2020.2975749","volume":"37","author":"T Li","year":"2020","unstructured":"Li, T., Sahu, A. K., Talwalkar, A., & Smith, V. (2020). Federated learning: Challenges, methods, and future directions. IEEE Signal Processing Magazine, 37(3), 50\u201360.","journal-title":"IEEE Signal Processing Magazine"},{"key":"6620_CR51","first-page":"429","volume":"2","author":"T Li","year":"2020","unstructured":"Li, T., Sahu, A. K., Zaheer, M., Sanjabi, M., Talwalkar, A., & Smith, V. (2020). Federated optimization in heterogeneous networks. Proceedings of Machine Learning and Systems, 2, 429\u2013450.","journal-title":"Proceedings of Machine Learning and Systems"},{"key":"6620_CR52","first-page":"29929","volume":"35","author":"X Liu","year":"2022","unstructured":"Liu, X., Kong, W., Jain, P., & Oh, S. (2022). Dp-pca: Statistically optimal and differentially private pca. Advances in Neural Information Processing Systems, 35, 29929\u201329943.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"6620_CR53","unstructured":"McMahan, B., Moore, E., Ramage, D., Hampson, S., & Arcas, B. A. (2017). Communication-efficient learning of deep networks from decentralized data. In Artificial Intelligence and Statistics (pp. 1273\u20131282 ). PMLR."},{"key":"6620_CR54","unstructured":"McMahan, H.B., Ramage, D., Talwar, K., & Zhang, L. (2018). Learning differentially private recurrent language models. In International Conference on Learning Representations. https:\/\/openreview.net\/forum?id=BJ0hF1Z0b"},{"key":"6620_CR55","unstructured":"Melis, L., Song, C., De\u00a0Cristofaro, E., & Shmatikov, V. (2018). Inference attacks against collaborative learning. arXiv preprint arXiv:1805.04049."},{"key":"6620_CR56","doi-asserted-by":"crossref","unstructured":"Mironov, I. (2017). R\u00e9nyi differential privacy. In 2017 IEEE 30th Computer Security Foundations Symposium (CSF) (pp. 263\u2013275). IEEE.","DOI":"10.1109\/CSF.2017.11"},{"key":"6620_CR57","unstructured":"Musco, C., & Musco, C. (2015). Randomized block krylov methods for stronger and faster approximate singular value decomposition. Advances in neural information processing systems,28."},{"issue":"1","key":"6620_CR58","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1287\/opre.2016.1534","volume":"65","author":"S Negahban","year":"2017","unstructured":"Negahban, S., Oh, S., & Shah, D. (2017). Rank centrality: Ranking from pairwise comparisons. Operations Research, 65(1), 266\u2013287.","journal-title":"Operations Research"},{"issue":"9","key":"6620_CR59","doi-asserted-by":"publisher","first-page":"3400","DOI":"10.1109\/TNNLS.2019.2944481","volume":"31","author":"F Sattler","year":"2019","unstructured":"Sattler, F., Wiedemann, S., M\u00fcller, K.-R., & Samek, W. (2019). Robust and communication-efficient federated learning from non-iid data. IEEE transactions on Neural Networks and Learning Systems, 31(9), 3400\u20133413.","journal-title":"IEEE transactions on Neural Networks and Learning Systems"},{"issue":"1","key":"6620_CR60","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02289451","volume":"31","author":"PH Sch\u00f6nemann","year":"1966","unstructured":"Sch\u00f6nemann, P. H. (1966). A generalized solution of the orthogonal procrustes problem. Psychometrika, 31(1), 1\u201310.","journal-title":"Psychometrika"},{"key":"6620_CR61","unstructured":"Singhal, V., & Steinke, T. (2021). Privately learning subspaces. Advances in Neural Information Processing Systems,34."},{"key":"6620_CR62","unstructured":"Smith, V., Chiang, C.-K., Sanjabi, M., & Talwalkar, A. S. (2017). Federated multi-task learning. Advances in Neural Information Processing Systems,30."},{"key":"6620_CR63","unstructured":"Stich, S. U. (2018). Local SGD converges fast and communicates little. arXiv preprint arXiv:1805.09767"},{"key":"6620_CR64","unstructured":"Upadhyay, J. (2018). The price of privacy for low-rank factorization. Advances in Neural Information Processing Systems,31."},{"issue":"4","key":"6620_CR65","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U Von Luxburg","year":"2007","unstructured":"Von Luxburg, U. (2007). A tutorial on spectral clustering. Statistics and Computing, 17(4), 395\u2013416.","journal-title":"Statistics and Computing"},{"key":"6620_CR66","unstructured":"Wang, J., & Joshi, G. (2018). Cooperative SGD: A unified framework for the design and analysis of communication-efficient SGD algorithms. arXiv preprint arXiv:1808.07576"},{"issue":"1","key":"6620_CR67","first-page":"431","volume":"20","author":"S Wang","year":"2019","unstructured":"Wang, S., Gittens, A., & Mahoney, M. W. (2019). Scalable kernel k-means clustering with nystr\u00f6m approximation: relative-error bounds. The Journal of Machine Learning Research, 20(1), 431\u2013479.","journal-title":"The Journal of Machine Learning Research"},{"issue":"1","key":"6620_CR68","first-page":"1697","volume":"17","author":"S Wang","year":"2016","unstructured":"Wang, S., Luo, L., & Zhang, Z. (2016). SPSD matrix approximation vis column selection: Theories, algorithms, and extensions. The Journal of Machine Learning Research, 17(1), 1697\u20131745.","journal-title":"The Journal of Machine Learning Research"},{"issue":"1\u20133","key":"6620_CR69","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0169-7439(87)80084-9","volume":"2","author":"S Wold","year":"1987","unstructured":"Wold, S., Esbensen, K., & Geladi, P. (1987). Principal component analysis. Chemometrics and Intelligent Laboratory Systems, 2(1\u20133), 37\u201352.","journal-title":"Chemometrics and Intelligent Laboratory Systems"},{"key":"6620_CR70","unstructured":"Woodruff, D. P. (2014). Sketching as a tool for numerical linear algebra. arXiv preprint arXiv:1411.4357"},{"issue":"8","key":"6620_CR71","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1109\/JPROC.2018.2846568","volume":"106","author":"SX Wu","year":"2018","unstructured":"Wu, S. X., Wai, H.-T., Li, L., & Scaglione, A. (2018). A review of distributed algorithms for principal component analysis. Proceedings of the IEEE, 106(8), 1321\u20131340.","journal-title":"Proceedings of the IEEE"},{"issue":"238","key":"6620_CR72","first-page":"1","volume":"22","author":"H Ye","year":"2021","unstructured":"Ye, H., & Zhang, T. (2021). Deepca: Decentralized exact pca with linear convergence rate. Journal of Machine Learning Research, 22(238), 1\u201327.","journal-title":"Journal of Machine Learning Research"},{"key":"6620_CR73","doi-asserted-by":"crossref","unstructured":"Yu, H., Yang, S., & Zhu, S. (2019). Parallel restarted SGD with faster convergence and less communication: Demystifying why model averaging works for deep learning. In AAAI Conference on Artificial Intelligence.","DOI":"10.1609\/aaai.v33i01.33015693"},{"key":"6620_CR74","unstructured":"Zheng, Q., Chen, S., Long, Q., & Su, W. (2021). Federated f-differential privacy. In International Conference on Artificial Intelligence and Statistics (pp. 2251\u20132259). PMLR."},{"key":"6620_CR75","doi-asserted-by":"crossref","unstructured":"Zhou, F., & Cong, G. (2017). On the convergence properties of a k-step averaging stochastic gradient descent algorithm for nonconvex optimization. arXiv preprint arXiv:1708.01012","DOI":"10.24963\/ijcai.2018\/447"},{"issue":"3","key":"6620_CR76","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1287\/ijoc.2019.0912","volume":"32","author":"Y Zhou","year":"2020","unstructured":"Zhou, Y., & Tang, S. (2020). Differentially private distributed learning. INFORMS Journal on Computing, 32(3), 779\u2013789.","journal-title":"INFORMS Journal on Computing"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-024-06620-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-024-06620-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-024-06620-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T18:13:28Z","timestamp":1764267208000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-024-06620-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,26]]},"references-count":76,"journal-issue":{"issue":"11-12","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["6620"],"URL":"https:\/\/doi.org\/10.1007\/s10994-024-06620-0","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,26]]},"assertion":[{"value":"29 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 September 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The authors provide the appropriate consent to participate.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"The authors provide the consent to publish the images in the manuscript.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}