{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T08:59:18Z","timestamp":1765357158096,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030968953"},{"type":"electronic","value":"9783030968960"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-96896-0_17","type":"book-chapter","created":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T12:16:52Z","timestamp":1657196212000},"page":"391-414","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Dealing with Byzantine Threats to Neural Networks"],"prefix":"10.1007","author":[{"given":"Yi","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Nathalie","family":"Baracaldo","sequence":"additional","affiliation":[]},{"given":"Ali","family":"Anwar","sequence":"additional","affiliation":[]},{"given":"Kamala","family":"Varma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,8]]},"reference":[{"key":"17_CR1","first-page":"30","volume-title":"Machine learning with adversaries: byzantine tolerant gradient descent","author":"P Blanchard","year":"2017","unstructured":"Blanchard P, El Mhamdi EM, Guerraoui R, Stainer J (2017) Machine learning with adversaries: byzantine tolerant gradient descent. Advances in Neural Information Processing Systems, p 30"},{"doi-asserted-by":"crossref","unstructured":"Charikar M, Steinhardt J, Valiant G (2017, June) Learning from untrusted data. In: Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, pp 47\u201360","key":"17_CR2","DOI":"10.1145\/3055399.3055491"},{"issue":"2","key":"17_CR3","first-page":"1","volume":"1","author":"Y Chen","year":"2017","unstructured":"Chen, Y., Su, L., & Xu, J. (2017). Distributed statistical machine learning in adversarial settings: Byzantine gradient descent. Proceedings of the ACM on measurement and analysis of computing systems, 1(2), 1\u201325","journal-title":"Proceedings of the ACM on measurement and analysis of computing systems"},{"unstructured":"El-Mhamdi, E. M., Guerraoui, R., & Rouault, S. (2020). Distributed momentum for byzantine-resilient learning. arXiv preprint arXiv:2003.00010","key":"17_CR4"},{"unstructured":"Fung, C., Yoon, C. J., & Beschastnikh, I. (2018). Mitigating sybils in federated learning poisoning. arXiv preprint arXiv:1808.04866","key":"17_CR5"},{"doi-asserted-by":"crossref","unstructured":"Gao D, Liu Y, Huang A, Ju C, Yu H, Yang Q (2019) Privacy-preserving heterogeneous federated transfer learning. In: 2019 IEEE international conference on big data (Big Data). IEEE, pp 2552\u20132559","key":"17_CR6","DOI":"10.1109\/BigData47090.2019.9005992"},{"doi-asserted-by":"crossref","unstructured":"Krishnaswamy R, Li S, Sandeep S (2018, June) Constant approximation for k-median and k-means with outliers via iterative rounding. In: Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, pp 646\u2013659","key":"17_CR7","DOI":"10.1145\/3188745.3188882"},{"issue":"3","key":"17_CR8","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport L, Shostak R, Pease M (1982) The byzantine generals problem. ACM Trans Program Lang Syst 4(3):382\u2013401. https:\/\/doi.org\/10.1145\/357172.357176","journal-title":"ACM Trans Program Lang Syst"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"2278","DOI":"10.1109\/5.726791","volume":"86","author":"Y Lecun","year":"1998","unstructured":"Lecun Y, Bottou L, Bengio Y, Haffner P (1998) Gradient-based learning applied to document recognition. Proc IEEE 86:2278\u20132324","journal-title":"Proc IEEE"},{"unstructured":"Li T, Sahu AK, Zaheer M, Sanjabi M, Talwalkar A, Smith V (2018) Federated optimization in heterogeneous networks. Preprint. arXiv:1812.06127","key":"17_CR10"},{"unstructured":"Ludwig H, Baracaldo N, Thomas G, Zhou Y, Anwar A, Rajamoni S, Ong Y, Radhakrishnan J, Verma A, Sinn M et al (2020) IBM federated learning: an enterprise framework white paper v0. 1. Preprint. arXiv:2007.10987","key":"17_CR11"},{"unstructured":"McMahan B, Moore E, Ramage D, Hampson S, y Arcas, B. A. (2017, April) Communication-efficient learning of deep networks from decentralized data. In: Artificial intelligence and statistics, PMLR, pp 1273\u20131282","key":"17_CR12"},{"unstructured":"Guerraoui R, Rouault S (2018, July) The hidden vulnerability of distributed learning in byzantium. In: International conference on machine learning. PMLR, pp 3521\u20133530","key":"17_CR13"},{"unstructured":"Mu\u00f1oz-Gonz\u00e1lez, L., Co, K. T., & Lupu, E. C. (2019). Byzantine-robust federated machine learning through adaptive model averaging. arXiv preprint arXiv:1909.05125","key":"17_CR14"},{"unstructured":"Pillutla, K., Kakade, S. M., & Harchaoui, Z. (2019). Robust aggregation for federated learning. arXiv preprint arXiv:1912.13445","key":"17_CR15"},{"unstructured":"Rajput S, Wang H, Charles ZB, Papailiopoulos DS (2019) DETOX: A redundancy-based framework for faster and more robust gradient aggregation. CoRR abs\/1907.12205. http:\/\/arxiv.org\/abs\/1907.12205","key":"17_CR16"},{"doi-asserted-by":"crossref","unstructured":"Varma K, Zhou Y, Baracaldo N, Anwar A (2021) Legato: A layerwise gradient aggregation algorithm for mitigating byzantine attacks in federated learning","key":"17_CR17","DOI":"10.1109\/CLOUD53861.2021.00040"},{"unstructured":"Wang H, Yurochkin M, Sun Y, Papailiopoulos D, Khazaeni Y (2020) Federated learning with matched averaging","key":"17_CR18"},{"doi-asserted-by":"publisher","unstructured":"Xia Q, Tao Z, Hao Z, Li Q (2019) Faba: An algorithm for fast aggregation against byzantine attacks in distributed neural networks. In: Proceedings of the twenty-eighth international joint conference on artificial intelligence, IJCAI-19. International joint conferences on artificial intelligence organization, pp 4824\u20134830. https:\/\/doi.org\/10.24963\/ijcai.2019\/670","key":"17_CR19","DOI":"10.24963\/ijcai.2019\/670"},{"unstructured":"Xie, C., Koyejo, O., & Gupta, I. (2018). Generalized byzantine-tolerant sgd. arXiv preprint arXiv:1802.10116","key":"17_CR20"},{"unstructured":"Xie C, Koyejo S, Gupta I (2019, May) Zeno: distributed stochastic gradient descent with suspicion-based fault-tolerance. In: International conference on machine learning. PMLR, pp 6893\u20136901","key":"17_CR21"},{"unstructured":"Xie C, Koyejo O, Gupta I (2020, August) Fall of empires: breaking byzantine-tolerant sgd by inner product manipulation. In: Uncertainty in artificial intelligence. PMLR, pp 261\u2013270","key":"17_CR22"},{"unstructured":"Yin D, Chen Y, Kannan R, Bartlett P (2018, July) Byzantine-robust distributed learning: towards optimal statistical rates. In: International conference on machine learning. PMLR, pp 5650\u20135659","key":"17_CR23"},{"unstructured":"Zhang, C., Bengio, S., & Singer, Y. (2019). Are all layers created equal?. arXiv preprint arXiv:1902.01996","key":"17_CR24"},{"unstructured":"Zhao, Y., Li, M., Lai, L., Suda, N., Civin, D., & Chandra, V. (2018). Federated learning with non-iid data. arXiv preprint arXiv:1806.00582","key":"17_CR25"}],"container-title":["Federated Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-96896-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T12:27:57Z","timestamp":1657196877000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-96896-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030968953","9783030968960"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-96896-0_17","relation":{},"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"8 February 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}