{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T04:16:59Z","timestamp":1777954619348,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":52,"publisher":"ACM","funder":[{"name":"German Research Foundation (DFG), Schwerpunktprogramm, SPP 2378 (project ReNO), 2023-2027","award":["SPP 2378"],"award-info":[{"award-number":["SPP 2378"]}]},{"name":"Academy of Finland, Grant 334238","award":["334238"],"award-info":[{"award-number":["334238"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,16]]},"DOI":"10.1145\/3694906.3743343","type":"proceedings-article","created":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T16:19:56Z","timestamp":1752682796000},"page":"89-100","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximate Agreement Algorithms for Byzantine Collaborative Learning"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7635-3924","authenticated-orcid":false,"given":"M\u00e9lanie","family":"Cambus","sequence":"first","affiliation":[{"name":"Aalto University, Espoo, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5614-8563","authenticated-orcid":false,"given":"Darya","family":"Melnyk","sequence":"additional","affiliation":[{"name":"TU Berlin, Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-8014-2600","authenticated-orcid":false,"given":"Tijana","family":"Milentijevi\u0107","sequence":"additional","affiliation":[{"name":"TU Berlin, Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7798-1711","authenticated-orcid":false,"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[{"name":"TU Berlin, Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,7,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.OPODIS.2022.6"},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings of the Twenty Third International Conference on Artificial Intelligence and Statistics (Proceedings of Machine Learning Research","volume":"2948","author":"Bagdasaryan Eugene","year":"2020","unstructured":"Eugene Bagdasaryan, Andreas Veit, Yiqing Hua, Deborah Estrin, and Vitaly Shmatikov. 2020. How To Backdoor Federated Learning. In Proceedings of the Twenty Third International Conference on Artificial Intelligence and Statistics (Proceedings of Machine Learning Research, Vol. 108). PMLR, 2938--2948. https:\/\/proceedings.mlr.press\/v108\/bagdasaryan20a.html"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(86)80015-3"},{"key":"e_1_3_2_1_4_1","volume-title":"signSGD with majority vote is communication efficient and fault tolerant. arXiv preprint arXiv:1810.05291","author":"Bernstein Jeremy","year":"2018","unstructured":"Jeremy Bernstein, Jiawei Zhao, Kamyar Azizzadenesheli, and Anima Anandkumar. 2018. signSGD with majority vote is communication efficient and fault tolerant. arXiv preprint arXiv:1810.05291 (2018)."},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of the 36th International Conference on Machine Learning (Proceedings of Machine Learning Research","volume":"643","author":"Bhagoji Arjun Nitin","year":"2019","unstructured":"Arjun Nitin Bhagoji, Supriyo Chakraborty, Prateek Mittal, and Seraphin Calo. 2019. Analyzing Federated Learning through an Adversarial Lens. In Proceedings of the 36th International Conference on Machine Learning (Proceedings of Machine Learning Research, Vol. 97). PMLR, 634--643. https:\/\/proceedings.mlr.press\/v97\/bhagoji19a.html"},{"key":"e_1_3_2_1_6_1","volume-title":"Rachid Guerraoui, and Julien Stainer.","author":"Blanchard Peva","year":"2017","unstructured":"Peva Blanchard, El Mahdi El Mhamdi, Rachid Guerraoui, and Julien Stainer. 2017. Machine learning with adversaries: Byzantine tolerant gradient descent. Advances in neural information processing systems 30 (2017). https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2017\/file\/f4b9ec30ad9f68f89b29639786cb62ef-Paper.pdf"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1080173"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","unstructured":"Stephen Boyd Neal Parikh Eric Chu Borja Peleato Jonathan Eckstein et al. 2011. Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends\u00ae in Machine learning (2011). https:\/\/doi.org\/10.1561\/2200000016","DOI":"10.1561\/2200000016"},{"key":"e_1_3_2_1_9_1","volume-title":"Convex optimization","author":"Boyd Stephen","unstructured":"Stephen Boyd and Lieven Vandenberghe. 2004. Convex optimization. Cambridge university press."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90054-X"},{"key":"e_1_3_2_1_11_1","unstructured":"Melanie Cambus and Darya Melnyk. 2023. Improved Solutions for Multidimensional Approximate Agreement via Centroid Computation. arXiv:2306.12741 [cs.DC] https:\/\/arxiv.org\/abs\/2306.12741"},{"key":"e_1_3_2_1_12_1","unstructured":"M\u00e9lanie Cambus Darya Melnyk Tijana Milentijevi\u0107 and Stefan Schmid. 2025. Centroid Approximation for Byzantine-Tolerant Federated Learning. arXiv:2506.15264 [cs.LG] https:\/\/arxiv.org\/abs\/2506.15264"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3154503"},{"key":"e_1_3_2_1_14_1","unstructured":"El-Mahdi El-Mhamdi Sadegh Farhadkhani Rachid Guerraoui Arsany Guirguis L\u00ea-Nguy\u00ean Hoang and S\u00e9bastien Rouault. 2021. Collaborative learning in the jungle (decentralized byzantine heterogeneous asynchronous and nonconvex learning) (NIPS '21)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405695"},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the 35th International Conference on Machine Learning (Proceedings of Machine Learning Research","volume":"3530","author":"El Mhamdi El Mahdi","year":"2018","unstructured":"El Mahdi El Mhamdi, Rachid Guerraoui, and S\u00e9bastien Rouault. 2018. The Hidden Vulnerability of Distributed Learning in Byzantium. In Proceedings of the 35th International Conference on Machine Learning (Proceedings of Machine Learning Research, Vol. 80). PMLR, 3521--3530. https:\/\/proceedings.mlr.press\/v80\/mhamdi18a.html"},{"key":"e_1_3_2_1_17_1","volume-title":"29th USENIX Security Symposium (USENIX Security 20)","author":"Fang Minghong","year":"2020","unstructured":"Minghong Fang, Xiaoyu Cao, Jinyuan Jia, and Neil Gong. 2020. Local Model Poisoning Attacks to Byzantine-Robust Federated Learning. In 29th USENIX Security Symposium (USENIX Security 20). USENIX Association. https:\/\/www.usenix.org\/conference\/usenixsecurity20\/presentation\/fang"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3662158.3662802"},{"key":"e_1_3_2_1_19_1","unstructured":"Jiashi Feng Huan Xu and Shie Mannor. 2015. Distributed Robust Learning. arXiv:1409.5937 [stat.ML]"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(82)90033-3"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3558481.3591105"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-021-05970-3"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN48987.2021.00021"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3616537"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSEC.2020.3039941"},{"key":"e_1_3_2_1_26_1","volume-title":"Stochastic-sign SGD for federated learning with theoretical guarantees. arXiv preprint arXiv:2002.10940","author":"Jin Richeng","year":"2020","unstructured":"Richeng Jin, Yufan Huang, Xiaofan He, Huaiyu Dai, and Tianfu Wu. 2020. Stochastic-sign SGD for federated learning with theoretical guarantees. arXiv preprint arXiv:2002.10940 (2020)."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Peter Kairouz H. Brendan McMahan Brendan Avent Aur\u00e9lien Bellet Mehdi Bennis Arjun Nitin Bhagoji Kallista Bonawit Zachary Charles Graham Cormode Rachel Cummings Rafael G. L. D'Oliveira Hubert Eichner Salim El Rouayheb David Evans Josh Gardner Zachary Garrett Adri\u00e0 Gasc\u00f3n Badih Ghazi Phillip B. Gibbons Marco Gruteser Zaid Harchaoui Chaoyang He Lie He Zhouyuan Huo Ben Hutchinson Justin Hsu Martin Jaggi Tara Javidi Gauri Joshi Mikhail Khodak Jakub Konecn\u00fd Aleksandra Korolova Farinaz Koushanfar Sanmi Koyejo Tancr\u00e8de Lepoint Yang Liu Prateek Mittal Mehryar Mohri Richard Nock Ayfer \u00d6zg\u00fcr Rasmus Pagh Hang Qi Daniel Ramage Ramesh Raskar Mariana Raykova Dawn Song Weikang Song Sebastian U. Stich Ziteng Sun Ananda Theertha Suresh Florian Tram\u00e8r Praneeth Vepakomma Jianyu Wang Li Xiong Zheng Xu Qiang Yang Felix X. Yu Han Yu and Sen Zhao. 2021. Advances and Open Problems in Federated Learning.","DOI":"10.1561\/9781680837896"},{"key":"e_1_3_2_1_28_1","volume-title":"Proceedings of the 38th International Conference on Machine Learning (Proceedings of Machine Learning Research","volume":"5319","author":"Karimireddy Sai Praneeth","year":"2021","unstructured":"Sai Praneeth Karimireddy, Lie He, and Martin Jaggi. 2021. Learning from History for Byzantine Robust Optimization. In Proceedings of the 38th International Conference on Machine Learning (Proceedings of Machine Learning Research, Vol. 139). PMLR, 5311--5319. https:\/\/proceedings.mlr.press\/v139\/karimireddy21a.html"},{"key":"e_1_3_2_1_29_1","unstructured":"Jakub Kone\u010dn\u00fd Brendan McMahan and Daniel Ramage. 2015. Federated Optimization:Distributed Optimization Beyond the Datacenter. arXiv:1511.03575"},{"key":"e_1_3_2_1_30_1","volume-title":"Ananda Theertha Suresh, and Dave Bacon","author":"Kone\u010dn\u00fd Jakub","year":"2017","unstructured":"Jakub Kone\u010dn\u00fd, H. Brendan McMahan, Felix X. Yu, Peter Richt\u00e1rik, Ananda Theertha Suresh, and Dave Bacon. 2017. Federated Learning: Strategies for Improving Communication Efficiency. arXiv:1610.05492"},{"key":"e_1_3_2_1_31_1","volume-title":"A note on Fermat's problem. Mathematical programming 4","author":"Kuhn Harold W","year":"1973","unstructured":"Harold W Kuhn. 1973. A note on Fermat's problem. Mathematical programming 4 (1973), 98--107."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/3295222.3295285"},{"key":"e_1_3_2_1_34_1","volume-title":"Proceedings of the 20th International Conference on Artificial Intelligence and Statistics (Proceedings of Machine Learning Research","volume":"1282","author":"McMahan Brendan","year":"2017","unstructured":"Brendan McMahan, Eider Moore, Daniel Ramage, Seth Hampson, and Blaise Aguera y Arcas. 2017. Communication-Efficient Learning of Deep Networks from Decentralized Data. In Proceedings of the 20th International Conference on Artificial Intelligence and Statistics (Proceedings of Machine Learning Research, Vol. 54), Aarti Singh and Jerry Zhu (Eds.). PMLR, 1273--1282. https:\/\/proceedings.mlr.press\/v54\/mcmahan17a.html"},{"key":"e_1_3_2_1_35_1","volume-title":"Proceedings of the 20th International Conference on Artificial Intelligence and Statistics (Proceedings of Machine Learning Research","volume":"1282","author":"McMahan Brendan","year":"2017","unstructured":"Brendan McMahan, Eider Moore, Daniel Ramage, Seth Hampson, and Blaise Aguera y Arcas. 2017. Communication-Efficient Learning of Deep Networks from Decentralized Data. In Proceedings of the 20th International Conference on Artificial Intelligence and Statistics (Proceedings of Machine Learning Research, Vol. 54). PMLR, 1273--1282. https:\/\/proceedings.mlr.press\/v54\/mcmahan17a.html"},{"key":"e_1_3_2_1_36_1","volume-title":"Federated learning of deep networks using model averaging. arXiv preprint arXiv:1602.05629","author":"McMahan H Brendan","year":"2016","unstructured":"H Brendan McMahan, Eider Moore, Daniel Ramage, and Blaise Ag\u00fcera y Arcas. 2016. Federated learning of deep networks using model averaging. arXiv preprint arXiv:1602.05629 (2016)."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488657"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-014-0240-5"},{"key":"e_1_3_2_1_39_1","volume-title":"Proceedings of The 25th International Conference on Artificial Intelligence and Statistics (Proceedings of Machine Learning Research","volume":"10145","author":"Noble Maxence","year":"2022","unstructured":"Maxence Noble, Aur\u00e9lien Bellet, and Aymeric Dieuleveut. 2022. Differentially Private Federated Learning on Heterogeneous Data. In Proceedings of The 25th International Conference on Artificial Intelligence and Statistics (Proceedings of Machine Learning Research, Vol. 151). PMLR, 10110--10145. https:\/\/proceedings.mlr.press\/v151\/noble22a.html"},{"key":"e_1_3_2_1_40_1","volume-title":"Proceedings of the 41st International Conference on Machine Learning (Proceedings of Machine Learning Research","volume":"39780","author":"Park Chanho","year":"2024","unstructured":"Chanho Park and Namyoon Lee. 2024. SignSGD with Federated Defense: Harnessing Adversarial Attacks through Gradient Sign Decoding. In Proceedings of the 41st International Conference on Machine Learning (Proceedings of Machine Learning Research, Vol. 235). PMLR, 39762--39780. https:\/\/proceedings.mlr.press\/v235\/park24h.html"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2022.3153135"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","unstructured":"Junyu Shi Wei Wan Shengshan Hu Jianrong Lu and Leo Yu Zhang. 2022. Challenges and Approaches for Mitigating Byzantine Attacks in Federated Learning. In 2022 IEEE International Conference on Trust Security and Privacy in Computing and Communications (TrustCom). https:\/\/doi.org\/10.1109\/TrustCom56396.2022.00030","DOI":"10.1109\/TrustCom56396.2022.00030"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.2307\/1403809"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01667080"},{"key":"e_1_3_2_1_45_1","volume-title":"Vaidya","author":"Su Lili","year":"2016","unstructured":"Lili Su and Nitin H. Vaidya. 2016. Non-Bayesian Learning in the Presence of Byzantine Agents. In Distributed Computing, Cyril Gavoille and David Ilcinkas (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 414--427."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484256"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2988575"},{"key":"e_1_3_2_1_48_1","first-page":"355","article-title":"Sur le point pour lequel la somme des distances de n points donn\u00e9s est minimum","volume":"43","author":"Weiszfeld Endre","year":"1937","unstructured":"Endre Weiszfeld. 1937. Sur le point pour lequel la somme des distances de n points donn\u00e9s est minimum. Tohoku Mathematical Journal, First Series 43 (1937), 355--386.","journal-title":"Tohoku Mathematical Journal, First Series"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-008-0352-z"},{"key":"e_1_3_2_1_50_1","volume-title":"Proceedings of the 35th International Conference on Machine Learning (Proceedings of Machine Learning Research","volume":"5659","author":"Yin Dong","year":"2018","unstructured":"Dong Yin, Yudong Chen, Ramchandran Kannan, and Peter Bartlett. 2018. Byzantine-Robust Distributed Learning: Towards Optimal Statistical Rates. In Proceedings of the 35th International Conference on Machine Learning (Proceedings of Machine Learning Research, Vol. 80). PMLR, 5650--5659. https:\/\/proceedings.mlr.press\/v80\/yin18a.html"},{"key":"e_1_3_2_1_51_1","unstructured":"Chengliang Zhang Suyi Li Junzhe Xia Wei Wang Feng Yan and Yang Liu. 2020. {BatchCrypt}: Efficient homomorphic encryption for {Cross-Silo} federated learning. In 2020 USENIX annual technical conference (USENIX ATC 20). 493--506. https:\/\/www.usenix.org\/conference\/atc20\/presentation\/zhang-chengliang"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","unstructured":"Yue Zhao Meng Li Liangzhen Lai Naveen Suda Damon Civin and Vikas Chandra. 2018. Federated Learning with Non-IID Data. (2018). https:\/\/doi.org\/10.48550\/ARXIV.1806.00582","DOI":"10.48550\/ARXIV.1806.00582"}],"event":{"name":"SPAA '25: 37th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Portland OR USA","acronym":"SPAA '25","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"]},"container-title":["Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3694906.3743343","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T19:20:52Z","timestamp":1777922452000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3694906.3743343"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,16]]},"references-count":52,"alternative-id":["10.1145\/3694906.3743343","10.1145\/3694906"],"URL":"https:\/\/doi.org\/10.1145\/3694906.3743343","relation":{},"subject":[],"published":{"date-parts":[[2025,7,16]]},"assertion":[{"value":"2025-07-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}