{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T21:53:43Z","timestamp":1791323623976,"version":"4.3.1"},"reference-count":69,"publisher":"Institute of Mathematical Statistics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Statist."],"published-print":{"date-parts":[[2026,1,1]]},"abstract":"<jats:p>We study the problem of robust estimation and inference for contaminated data in distributed learning systems. Existing methods, such as those designed for Byzantine failures, typically assume that contamination is limited to a small subset of machines experiencing complete failure. In contrast, we address distributed partial contamination, where all machines may handle datasets containing some corrupted observations. By generalizing Huber\u2019s \u03f5-contamination model to distributed settings, we propose a robust framework in which each machine\u2019s dataset may be contaminated by a proportion \u03f5 of observations from an arbitrary distribution. In a linear model setting, we develop a communication-efficient M-estimator that achieves the optimal convergence rate of centralized data. For robust inference, we introduce a distributed multiplier bootstrap method that requires no additional communication post-estimation while maintaining efficiency. To handle high contamination proportions, we present a debiasing procedure to mitigate bias. Extensive simulations demonstrate the robustness and scalability of our methods across diverse contamination scenarios.<\/jats:p>","DOI":"10.1214\/26-ejs2492","type":"journal-article","created":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T11:59:43Z","timestamp":1770292783000},"page":"261-323","source":"Crossref","is-referenced-by-count":1,"title":["Distributed robust estimation and inference with contaminated data"],"prefix":"10.1214","volume":"20","author":[{"given":"Peiliang","family":"Zhang","sequence":"first","affiliation":[{"name":"Department of Statistics, University of Pittsburgh, Pittsburgh, PA, 15260, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wen-Xin","family":"Zhou","sequence":"additional","affiliation":[{"name":"Department of Information and Decision Sciences, University of Illinois Chicago, Chicago, IL, 60607, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhao","family":"Ren","sequence":"additional","affiliation":[{"name":"Department of Statistics, University of Pittsburgh, Pittsburgh, PA, 15260, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"108","reference":[{"key":"17","doi-asserted-by":"crossref","unstructured":"<small>DEVROYE, L.<\/small>, <small>LERASLE, M.<\/small>, <small>LUGOSI, G.<\/small> and <small>OLIVEIRA, R. I.<\/small> (2016). Sub-Gaussian mean estimators. <i>The Annals of Statistics<\/i> <b>44<\/b> 2695\u20132725.","DOI":"10.1214\/16-AOS1440"},{"key":"32","doi-asserted-by":"crossref","unstructured":"<small>LAI, K. A.<\/small>, <small>RAO, A. B.<\/small> and <small>VEMPALA, S.<\/small> (2016). Agnostic estimation of mean and covariance. In <i>2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)<\/i> 665\u2013674. IEEE.","DOI":"10.1109\/FOCS.2016.76"},{"key":"13","doi-asserted-by":"crossref","unstructured":"<small>CHEN, X.<\/small> and <small>XIE, M.-G.<\/small> (2014). A Split-and-Conquer Approach for Analysis of Extraordinarily Large Data. <i>Statistica Sinica<\/i> <b>24<\/b> 1655\u20131684.","DOI":"10.5705\/ss.2013.088"},{"key":"3","doi-asserted-by":"crossref","unstructured":"<small>Bakshi, A.<\/small> and <small>Prasad, A.<\/small> (2021). Robust linear regression: Optimal rates in polynomial time. In <i>Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing<\/i> 102\u2013115.","DOI":"10.1145\/3406325.3451001"},{"key":"6","doi-asserted-by":"crossref","unstructured":"<small>Bickel, P. J.<\/small> (1975). One-step Huber estimates in the linear model. <i>Journal of the American Statistical Association<\/i> <b>70<\/b> 428\u2013434.","DOI":"10.1080\/01621459.1975.10479884"},{"key":"19","doi-asserted-by":"crossref","unstructured":"<small>Diakonikolas, I.<\/small>, <small>Kong, W.<\/small> and <small>Stewart, A.<\/small> (2019). Efficient algorithms and lower bounds for robust linear regression. In <i>Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms<\/i> 2745\u20132754. SIAM.","DOI":"10.1137\/1.9781611975482.170"},{"key":"8","doi-asserted-by":"crossref","unstructured":"<small>Boucheron, S.<\/small>, <small>Lugosi, G.<\/small> and <small>Massart, P.<\/small> (2013). <i>Concentration inequalities: A nonasymptotic theory of independence<\/i>. Oxford university press.","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"},{"key":"56","doi-asserted-by":"crossref","unstructured":"<small>SUN, Q.<\/small>, <small>ZHOU, W.-X.<\/small> and <small>FAN, J.<\/small> (2020). Adaptive Huber regression. <i>Journal of the American Statistical Association<\/i> <b>115<\/b> 254\u2013265.","DOI":"10.1080\/01621459.2018.1543124"},{"key":"60","doi-asserted-by":"crossref","unstructured":"<small>Vershynin, R.<\/small> (2018). <i>High-dimensional probability: An introduction with applications in data science<\/i> <b>47<\/b>. Cambridge University Press.","DOI":"10.1017\/9781108231596"},{"key":"55","unstructured":"<small>SUGGALA, A. S.<\/small>, <small>BHATIA, K.<\/small>, <small>RAVIKUMAR, P.<\/small> and <small>JAIN, P.<\/small> (2019). Adaptive hard thresholding for near-optimal consistent robust regression. In <i>Conference on Learning Theory<\/i> 2892\u20132897. PMLR."},{"key":"31","doi-asserted-by":"crossref","unstructured":"<small>KLEINER, A.<\/small>, <small>TALWALKAR, A.<\/small>, <small>SARKAR, P.<\/small> and <small>JORDAN, M. I.<\/small> (2014). A scalable bootstrap for massive data. <i>Journal of the Royal Statistical Society: Series B (Statistical Methodology)<\/i> <b>76<\/b> 795\u2013816.","DOI":"10.1111\/rssb.12050"},{"key":"14","doi-asserted-by":"crossref","unstructured":"<small>CHEN, X.<\/small> and <small>ZHOU, W.-X.<\/small> (2020). Robust inference via multiplier bootstrap. <i>The Annals of Statistics<\/i> <b>48<\/b> 1665\u20131691.","DOI":"10.1214\/19-AOS1863"},{"key":"41","doi-asserted-by":"crossref","unstructured":"<small>NGUYEN, N. H.<\/small> and <small>TRAN, T. D.<\/small> (2012). Robust lasso with missing and grossly corrupted observations. <i>IEEE transactions on information theory<\/i> <b>59<\/b> 2036\u20132058.","DOI":"10.1109\/TIT.2012.2232347"},{"key":"1","doi-asserted-by":"crossref","unstructured":"<small>ADAMCZAK, R.<\/small>, <small>LITVAK, A. E.<\/small>, <small>PAJOR, A.<\/small> and <small>TOMCZAK-JAEGERMANN, N.<\/small> (2011). Restricted isometry property of matrices with independent columns and neighborly polytopes by random sampling. <i>Constructive Approximation<\/i> <b>34<\/b> 61\u201388.","DOI":"10.1007\/s00365-010-9117-4"},{"key":"2","unstructured":"<small>ALISTARH, D.<\/small>, <small>ALLEN-ZHU, Z.<\/small> and <small>LI, J.<\/small> (2018). Byzantine stochastic gradient descent. <i>Advances in Neural Information Processing Systems<\/i> <b>31<\/b> 4618\u20134628."},{"key":"4","unstructured":"<small>BATTEY, H.<\/small>, <small>FAN, J.<\/small>, <small>LIU, H.<\/small>, <small>LU, J.<\/small> and <small>ZHU, Z.<\/small> (2018). Distributed testing and estimation under sparse high dimensional models. <i>The Annals of Statistics<\/i> <b>46<\/b> 1352 \u2013 1382."},{"key":"5","unstructured":"<small>BHATIA, K.<\/small>, <small>JAIN, P.<\/small>, <small>KAMALARUBAN, P.<\/small> and <small>KAR, P.<\/small> (2017). Consistent robust regression. <i>Advances in Neural Information Processing Systems<\/i> <b>30<\/b> 2107\u20132116."},{"key":"7","unstructured":"<small>BLANCHARD, P.<\/small>, <small>EL MHAMDI, E. M.<\/small>, <small>GUERRAOUI, R.<\/small> and <small>STAINER, J.<\/small> (2017). Machine learning with adversaries: Byzantine tolerant gradient descent. <i>Advances in Neural Information Processing Systems<\/i> <b>30<\/b> 118\u2013128."},{"key":"9","doi-asserted-by":"crossref","unstructured":"<small>BOYD, S.<\/small>, <small>PARIKH, N.<\/small>, <small>CHU, E.<\/small>, <small>PELEATO, B.<\/small>, <small>ECKSTEIN, J.<\/small> et al. (2011). Distributed optimization and statistical learning via the alternating direction method of multipliers. <i>Foundations and Trends<\/i>\u00ae <i>in Machine Learning<\/i> <b>3<\/b> 1\u2013122.","DOI":"10.1561\/2200000016"},{"key":"10","unstructured":"<small>CHEN, M.<\/small>, <small>GAO, C.<\/small> and <small>REN, Z.<\/small> (2016). A general decision theory for Huber\u2019s <i>\u03f5<\/i>-contamination model. <i>Electronic Journal of Statistics<\/i> <b>10<\/b> 3752\u20133774."},{"key":"11","doi-asserted-by":"crossref","unstructured":"<small>CHEN, M.<\/small>, <small>GAO, C.<\/small> and <small>REN, Z.<\/small> (2018). Robust covariance and scatter matrix estimation under Huber\u2019s contamination model. <i>The Annals of Statistics<\/i> <b>46<\/b> 1932\u20131960.","DOI":"10.1214\/17-AOS1607"},{"key":"12","unstructured":"<small>CHEN, X.<\/small>, <small>LIU, W.<\/small>, <small>MAO, X.<\/small> and <small>YANG, Z.<\/small> (2020). Distributed high-dimensional regression under a quantile loss function. <i>Journal of Machine Learning Research<\/i> <b>21<\/b> 1\u201343."},{"key":"15","doi-asserted-by":"crossref","unstructured":"<small>CHEN, Y.<\/small>, <small>SU, L.<\/small> and <small>XU, J.<\/small> (2017). Distributed statistical machine learning in adversarial settings: Byzantine gradient descent. <i>Proceedings of the ACM on Measurement and Analysis of Computing Systems<\/i> <b>1<\/b> 1\u201325.","DOI":"10.1145\/3154503"},{"key":"16","unstructured":"<small>CORBETT, J. C.<\/small>, <small>DEAN, J.<\/small>, <small>EPSTEIN, M.<\/small>, <small>FIKES, A.<\/small>, <small>FROST, C.<\/small>, <small>FURMAN, J. J.<\/small>, <small>GHEMAWAT, S.<\/small>, <small>GUBAREV, A.<\/small>, <small>HEISER, C.<\/small>, <small>HOCHSCHILD, P.<\/small> et al. (2013). Spanner: Google\u2019s globally distributed database. <i>ACM Transactions on Computer Systems (TOCS)<\/i> <b>31<\/b> 1\u201322."},{"key":"18","doi-asserted-by":"crossref","unstructured":"<small>DIAKONIKOLAS, I.<\/small>, <small>KAMATH, G.<\/small>, <small>KANE, D.<\/small>, <small>LI, J.<\/small>, <small>MOITRA, A.<\/small> and <small>STEWART, A.<\/small> (2019). Robust estimators in high-dimensions without the computational intractability. <i>SIAM Journal on Computing<\/i> <b>48<\/b> 742\u2013864.","DOI":"10.1137\/17M1126680"},{"key":"20","doi-asserted-by":"crossref","unstructured":"<small>DUCHI, J. C.<\/small>, <small>AGARWAL, A.<\/small> and <small>WAINWRIGHT, M. J.<\/small> (2011). Dual averaging for distributed optimization: Convergence analysis and network scaling. <i>IEEE Transactions on Automatic Control<\/i> <b>57<\/b> 592\u2013606.","DOI":"10.1109\/TAC.2011.2161027"},{"key":"21","doi-asserted-by":"crossref","unstructured":"<small>FAN, J.<\/small>, <small>GUO, Y.<\/small> and <small>WANG, K.<\/small> (2023). Communication-efficient accurate statistical estimation. <i>Journal of the American Statistical Association<\/i> <b>118<\/b> 1000\u20131010.","DOI":"10.1080\/01621459.2021.1969238"},{"key":"22","doi-asserted-by":"crossref","unstructured":"<small>FAN, J.<\/small>, <small>LIU, H.<\/small>, <small>SUN, Q.<\/small> and <small>ZHANG, T.<\/small> (2018). I-LAMM for sparse learning: Simultaneous control of algorithmic complexity and statistical error. <i>The Annals of Statistics<\/i> <b>46<\/b> 814 \u2013 841.","DOI":"10.1214\/17-AOS1568"},{"key":"23","unstructured":"<small>FAN, J.<\/small>, <small>WANG, D.<\/small>, <small>WANG, K.<\/small> and <small>ZHU, Z.<\/small> (2019). Distributed estimation of principal eigenspaces. <i>The Annals of Statistics<\/i> <b>47<\/b> 3009 \u2013 3031."},{"key":"24","doi-asserted-by":"crossref","unstructured":"<small>GAO, C.<\/small> (2020). Robust regression via mutivariate regression depth. <i>Bernoulli<\/i> <b>26<\/b> 1139 \u2013 1170.","DOI":"10.3150\/19-BEJ1144"},{"key":"25","doi-asserted-by":"crossref","unstructured":"<small>HUANG, C.<\/small> and <small>HUO, X.<\/small> (2019). A distributed one-step estimator. <i>Mathematical Programming<\/i> <b>174<\/b> 41\u201376.","DOI":"10.1007\/s10107-019-01369-0"},{"key":"26","doi-asserted-by":"crossref","unstructured":"<small>HUANG, L.<\/small>, <small>SHEA, A. L.<\/small>, <small>QIAN, H.<\/small>, <small>MASURKAR, A.<\/small>, <small>DENG, H.<\/small> and <small>LIU, D.<\/small> (2019). Patient clustering improves efficiency of federated machine learning to predict mortality and hospital stay time using distributed electronic medical records. <i>Journal of Biomedical Informatics<\/i> <b>99<\/b> 103291.","DOI":"10.1016\/j.jbi.2019.103291"},{"key":"28","unstructured":"<small>JAGGI, M.<\/small>, <small>SMITH, V.<\/small>, <small>TAK\u00c1C, M.<\/small>, <small>TERHORST, J.<\/small>, <small>KRISHNAN, S.<\/small>, <small>HOFMANN, T.<\/small> and <small>JORDAN, M. I.<\/small> (2014). Communication-efficient distributed dual coordinate ascent. <i>Advances in Neural Information Processing Systems<\/i> <b>27<\/b> 3068\u20133076."},{"key":"29","doi-asserted-by":"crossref","unstructured":"<small>JORDAN, M. I.<\/small>, <small>LEE, D.<\/small> and <small>YANG, Y.<\/small> (2019). Communication-Efficient Distributed Statistical Inference. <i>Journal of the American Statistical Association<\/i> <b>114<\/b> 668-681.","DOI":"10.1080\/01621459.2018.1429274"},{"key":"30","unstructured":"<small>KANNAN, R.<\/small>, <small>VEMPALA, S.<\/small> and <small>WOODRUFF, D.<\/small> (2014). Principal component analysis and higher correlations for distributed data. In <i>Conference on Learning Theory<\/i> 1040\u20131057. PMLR."},{"key":"33","doi-asserted-by":"crossref","unstructured":"<small>LAMPORT, L.<\/small>, <small>SHOSTAK, R.<\/small> and <small>PEASE, M.<\/small> (1982). The Byzantine Generals Problem. <i>ACM Transactions on Programming Languages and Systems<\/i> <b>4<\/b> 382\u2013401.","DOI":"10.1145\/357172.357176"},{"key":"34","unstructured":"<small>LEE, J. D.<\/small>, <small>LIU, Q.<\/small>, <small>SUN, Y.<\/small> and <small>TAYLOR, J. E.<\/small> (2017). Communication-efficient sparse regression. <i>Journal of Machine Learning Research<\/i> <b>18<\/b> 115\u2013144."},{"key":"35","unstructured":"<small>LIN, S.-B.<\/small>, <small>WANG, D.<\/small> and <small>ZHOU, D.-X.<\/small> (2020). Distributed kernel ridge regression with communications. <i>Journal of Machine Learning Research<\/i> <b>21<\/b> 1\u201338."},{"key":"36","doi-asserted-by":"crossref","unstructured":"<small>LIU, H.<\/small> and <small>GAO, C.<\/small> (2019). Density estimation with contamination: minimax rates and theory of adaptation. <i>Electronic Journal of Statistics<\/i> <b>13<\/b> 3613\u20133653.","DOI":"10.1214\/19-EJS1617"},{"key":"37","doi-asserted-by":"crossref","unstructured":"<small>LUO, J.<\/small>, <small>SUN, Q.<\/small> and <small>ZHOU, W.-X.<\/small> (2022). Distributed adaptive Huber regression. <i>Computational Statistics &amp; Data Analysis<\/i> <b>169<\/b> 107419.","DOI":"10.1016\/j.csda.2021.107419"},{"key":"38","doi-asserted-by":"crossref","unstructured":"<small>MASSART, P.<\/small> (1990). The tight constant in the Dvoretzky-Kiefer-Wolfowitz inequality. <i>The Annals of Probability<\/i> <b>18<\/b> 1269 \u2013 1283.","DOI":"10.1214\/aop\/1176990746"},{"key":"39","unstructured":"<small>MCMAHAN, B.<\/small>, <small>MOORE, E.<\/small>, <small>RAMAGE, D.<\/small>, <small>HAMPSON, S.<\/small> and <small>ARCAS, B. A. Y.<\/small> (2017). Communication-Efficient Learning of Deep Networks from Decentralized Data. In <i>Proceedings of the 20th International Conference on Artificial Intelligence and Statistics<\/i> <b>54<\/b> 1273\u20131282. PMLR."},{"key":"40","doi-asserted-by":"crossref","unstructured":"<small>MINSKER, S.<\/small> (2019). Distributed statistical estimation and rates of convergence in normal approximation. <i>Electronic Journal of Statistics<\/i> <b>13<\/b> 5213\u20135252.","DOI":"10.1214\/19-EJS1647"},{"key":"42","doi-asserted-by":"crossref","unstructured":"<small>PALEY, R. E. A. C.<\/small> and <small>ZYGMUND, A.<\/small> (1932). A note on analytic functions in the unit circle. <i>Mathematical Proceedings of the Cambridge Philosophical Society<\/i> <b>28<\/b> 266\u2013272.","DOI":"10.1017\/S0305004100010112"},{"key":"43","doi-asserted-by":"crossref","unstructured":"<small>PAN, X.<\/small> and <small>ZHOU, W.-X.<\/small> (2021). Multiplier bootstrap for quantile regression: non-asymptotic theory under random design. <i>Information and Inference: A Journal of the IMA<\/i> <b>10<\/b> 813\u2013861.","DOI":"10.1093\/imaiai\/iaaa006"},{"key":"44","doi-asserted-by":"crossref","unstructured":"<small>PENSIA, A.<\/small>, <small>JOG, V.<\/small> and <small>LOH, P.-L.<\/small> (2025). Robust regression with covariate filtering: Heavy tails and adversarial contamination. <i>Journal of the American Statistical Association<\/i> <b>120<\/b> 1002\u20131013.","DOI":"10.1080\/01621459.2024.2392906"},{"key":"45","unstructured":"<small>RONCHETTI, E. M.<\/small> and <small>HUBER, P. J.<\/small> (2009). <i>Robust statistics<\/i>. John Wiley &amp; Sons."},{"key":"46","doi-asserted-by":"crossref","unstructured":"<small>ROSENBLATT, J. D.<\/small> and <small>NADLER, B.<\/small> (2016). On the optimality of averaging in distributed statistical learning. <i>Information and Inference: A Journal of the IMA<\/i> <b>5<\/b> 379\u2013404.","DOI":"10.1093\/imaiai\/iaw013"},{"key":"47","unstructured":"<small>SASAI, T.<\/small> and <small>FUJISAWA, H.<\/small> (2020). Robust estimation with Lasso when outputs are adversarially contaminated. <i>arXiv preprint<\/i> arXiv:<a href=\"https:\/\/arxiv.org\/abs\/2004.05990\">2004.05990<\/a>."},{"key":"48","doi-asserted-by":"crossref","unstructured":"<small>SENGUPTA, S.<\/small>, <small>VOLGUSHEV, S.<\/small> and <small>SHAO, X.<\/small> (2016). A subsampled double bootstrap for massive data. <i>Journal of the American Statistical Association<\/i> <b>111<\/b> 1222\u20131232.","DOI":"10.1080\/01621459.2015.1080709"},{"key":"49","unstructured":"<small>SHAMIR, O.<\/small>, <small>SREBRO, N.<\/small> and <small>ZHANG, T.<\/small> (2014). Communication-efficient distributed optimization using an approximate newton-type method. In <i>International Conference on Machine Learning<\/i> 1000\u20131008. PMLR."},{"key":"50","unstructured":"<small>SHANG, Z.<\/small> and <small>CHENG, G.<\/small> (2017). Computational limits of a distributed algorithm for smoothing spline. <i>Journal of Machine Learning Research<\/i> <b>18<\/b> 1\u201337."},{"key":"51","doi-asserted-by":"crossref","unstructured":"<small>SHE, Y.<\/small> and <small>OWEN, A. B.<\/small> (2011). Outlier detection using nonconvex penalized regression. <i>Journal of the American Statistical Association<\/i> <b>106<\/b> 626\u2013639.","DOI":"10.1198\/jasa.2011.tm10390"},{"key":"52","unstructured":"<small>SHEN, S.<\/small>, <small>LU, J.<\/small> and <small>LIN, X.<\/small> (2023). FADI: Fast Distributed Principal Component Analysis With High Accuracy for Large-Scale Federated Data. <i>arXiv preprint<\/i> arXiv:<a href=\"https:\/\/arxiv.org\/abs\/2306.06857\">2306.06857<\/a>."},{"key":"53","unstructured":"<small>SPOKOINY, V.<\/small> (2013). Bernstein-von Mises Theorem for growing parameter dimension. <i>arXiv preprint<\/i> arXiv:<a href=\"https:\/\/arxiv.org\/abs\/1302.3430\">1302.3430<\/a>."},{"key":"54","doi-asserted-by":"crossref","unstructured":"<small>SPOKOINY, V.<\/small> and <small>ZHILOVA, M.<\/small> (2015). Bootstrap confidence sets under model misspecification. <i>The Annals of Statistics<\/i> <b>43<\/b> 2653\u20132675.","DOI":"10.1214\/15-AOS1355"},{"key":"57","unstructured":"<small>TAN, K. M.<\/small>, <small>BATTEY, H.<\/small> and <small>ZHOU, W.-X.<\/small> (2022). Communication-constrained distributed quantile regression with optimal statistical guarantees. <i>Journal of Machine Learning Research<\/i> <b>23<\/b> 1\u201361."},{"key":"58","doi-asserted-by":"crossref","unstructured":"<small>TEH, H. Y.<\/small>, <small>KEMPA-LIEHR, A. W.<\/small> and <small>WANG, K. I.-K.<\/small> (2020). Sensor data quality: A systematic review. <i>Journal of Big Data<\/i> <b>7<\/b> 11.","DOI":"10.1186\/s40537-020-0285-1"},{"key":"59","doi-asserted-by":"crossref","unstructured":"<small>TYURIN, I. S.<\/small> (2011). On the convergence rate in Lyapunov\u2019s theorem. <i>Theory of Probability &amp; Its Applications<\/i> <b>55<\/b> 253\u2013270.","DOI":"10.1137\/S0040585X97984760"},{"key":"61","doi-asserted-by":"crossref","unstructured":"<small>VOLGUSHEV, S.<\/small>, <small>CHAO, S.-K.<\/small> and <small>CHENG, G.<\/small> (2019). Distributed inference for quantile regression processes. <i>The Annals of Statistics<\/i> <b>47<\/b> 1634 \u2013 1662.","DOI":"10.1214\/18-AOS1730"},{"key":"62","unstructured":"<small>WANG, J.<\/small>, <small>KOLAR, M.<\/small>, <small>SREBRO, N.<\/small> and <small>ZHANG, T.<\/small> (2017). Efficient distributed learning with sparsity. In <i>International Conference on Machine Learning<\/i> 3636\u20133645. PMLR."},{"key":"63","unstructured":"<small>YIN, D.<\/small>, <small>CHEN, Y.<\/small>, <small>KANNAN, R.<\/small> and <small>BARTLETT, P.<\/small> (2018). Byzantine-robust distributed learning: Towards optimal statistical rates. In <i>International Conference on Machine Learning<\/i> 5650\u20135659. PMLR."},{"key":"65","unstructured":"<small>YU, Y.<\/small>, <small>CHAO, S.-K.<\/small> and <small>CHENG, G.<\/small> (2020). Simultaneous inference for massive data: distributed bootstrap. In <i>International Conference on Machine Learning<\/i> 10892\u201310901. PMLR."},{"key":"66","unstructured":"<small>ZHANG, Y.<\/small>, <small>DUCHI, J.<\/small> and <small>WAINWRIGHT, M.<\/small> (2015). Divide and conquer kernel ridge regression: A distributed algorithm with minimax optimal rates. <i>Journal of Machine Learning Research<\/i> <b>16<\/b> 3299\u20133340."},{"key":"67","unstructured":"<small>ZHANG, Y.<\/small>, <small>DUCHI, J. C.<\/small> and <small>WAINWRIGHT, M. J.<\/small> (2013). Communication-Efficient Algorithms for Statistical Optimization. <i>Journal of Machine Learning Research<\/i> <b>14<\/b> 3321\u20133363."},{"key":"68","doi-asserted-by":"crossref","unstructured":"<small>ZHANG, Y.<\/small> and <small>XIAO, L.<\/small> (2018). Communication-efficient distributed optimization of self-concordant empirical loss. In <i>Large-Scale and Distributed Optimization<\/i> 289\u2013341. Springer.","DOI":"10.1007\/978-3-319-97478-1_11"},{"key":"69","doi-asserted-by":"crossref","unstructured":"<small>ZHU, B.<\/small>, <small>JIAO, J.<\/small> and <small>STEINHARDT, J.<\/small> (2022). Robust estimation via generalized quasi-gradients. <i>Information and Inference: A Journal of the IMA<\/i> <b>11<\/b> 581\u2013636.","DOI":"10.1093\/imaiai\/iaab018"},{"key":"64","doi-asserted-by":"crossref","unstructured":"<small>YU, B.<\/small> (1997). Assouad, Fano, and Le Cam. In <i>Festschrift for Lucien Le Cam: Research papers in probability and statistics<\/i> 423\u2013435. Springer.","DOI":"10.1007\/978-1-4612-1880-7_29"},{"key":"27","doi-asserted-by":"publisher","unstructured":"<small>HUBER, P. J.<\/small> (1964). Robust estimation of a location parameter. <i>The Annals of Mathematical Statistics<\/i> <b>35<\/b> 73\u2013101.","DOI":"10.1214\/aoms\/1177703732"}],"container-title":["Electronic Journal of Statistics"],"original-title":[],"deposited":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T21:42:04Z","timestamp":1791322924000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/electronic-journal-of-statistics\/volume-20\/issue-1\/Distributed-robust-estimation-and-inference-with-contaminated-data\/10.1214\/26-EJS2492.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,1]]},"references-count":69,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,1,1]]}},"URL":"https:\/\/doi.org\/10.1214\/26-ejs2492","relation":{},"ISSN":["1935-7524","1935-7524"],"issn-type":[{"value":"1935-7524","type":"print"},{"value":"1935-7524","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,1]]}}}