{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,26]],"date-time":"2025-12-26T07:08:37Z","timestamp":1766732917571,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T00:00:00Z","timestamp":1596153600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Foundation","award":["1842198"],"award-info":[{"award-number":["1842198"]}]},{"name":"Army Research Laboratory","award":["W911NF- 17-2-0196"],"award-info":[{"award-number":["W911NF- 17-2-0196"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,31]]},"DOI":"10.1145\/3382734.3405748","type":"proceedings-article","created":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T22:33:55Z","timestamp":1596234835000},"page":"365-374","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["Fault-Tolerance in Distributed Optimization: The Case of Redundancy"],"prefix":"10.1145","author":[{"given":"Nirupam","family":"Gupta","sequence":"first","affiliation":[{"name":"Georgetown University"}]},{"given":"Nitin H.","family":"Vaidya","sequence":"additional","affiliation":[{"name":"Georgetown University"}]}],"member":"320","published-online":{"date-parts":[[2020,7,31]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Advances in Neural Information Processing Systems","author":"Alistarh Dan","year":"2018","unstructured":"Dan Alistarh , Zeyuan Allen-Zhu , and Jerry Li . Byzantine stochastic gradient descent . In Advances in Neural Information Processing Systems , 2018 . Dan Alistarh, Zeyuan Allen-Zhu, and Jerry Li. Byzantine stochastic gradient descent. In Advances in Neural Information Processing Systems, 2018."},{"key":"e_1_3_2_1_2_1","volume-title":"signsgd with majority vote is communication efficient and Byzantine fault tolerant. arXiv preprint arXiv:1810.05291","author":"Bernstein Jeremy","year":"2018","unstructured":"Jeremy Bernstein , Jiawei Zhao , Kamyar Azizzadenesheli , and Anima Anandkumar . signsgd with majority vote is communication efficient and Byzantine fault tolerant. arXiv preprint arXiv:1810.05291 , 2018 . Jeremy Bernstein, Jiawei Zhao, Kamyar Azizzadenesheli, and Anima Anandkumar. signsgd with majority vote is communication efficient and Byzantine fault tolerant. arXiv preprint arXiv:1810.05291, 2018."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/59912"},{"key":"e_1_3_2_1_4_1","first-page":"119","volume-title":"Advances in Neural Information Processing Systems","author":"Blanchard Peva","year":"2017","unstructured":"Peva Blanchard , Rachid Guerraoui , Julien Stainer , Machine learning with adversaries: Byzantine tolerant gradient descent . In Advances in Neural Information Processing Systems , pages 119 -- 129 , 2017 . Peva Blanchard, Rachid Guerraoui, Julien Stainer, et al. Machine learning with adversaries: Byzantine tolerant gradient descent. In Advances in Neural Information Processing Systems, pages 119--129, 2017."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1080173"},{"key":"e_1_3_2_1_6_1","volume-title":"Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends\u00ae in Machine learning, 3(1)","author":"Boyd Stephen","year":"2011","unstructured":"Stephen Boyd , Neal Parikh , Eric Chu , Borja Peleato , Jonathan Eckstein , Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends\u00ae in Machine learning, 3(1) , 2011 . Stephen Boyd, Neal Parikh, Eric Chu, Borja Peleato, Jonathan Eckstein, et al. Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends\u00ae in Machine learning, 3(1), 2011."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/993483"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2946020"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055491"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2813330"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3154503"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2015.7171098"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2161027"},{"key":"e_1_3_2_1_14_1","volume-title":"Byzantine fault tolerant distributed linear regression. arXiv preprint arXiv:1903.08752","author":"Gupta Nirupam","year":"2019","unstructured":"Nirupam Gupta and Nitin H Vaidya . Byzantine fault tolerant distributed linear regression. arXiv preprint arXiv:1903.08752 , 2019 . Nirupam Gupta and Nitin H Vaidya. Byzantine fault tolerant distributed linear regression. arXiv preprint arXiv:1903.08752, 2019."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2019.8919735"},{"key":"e_1_3_2_1_16_1","volume-title":"Resilience in collaborative optimization: redundant and independent cost functions. arXiv preprint arXiv:2003.09675","author":"Gupta Nirupam","year":"2020","unstructured":"Nirupam Gupta and Nitin H Vaidya . Resilience in collaborative optimization: redundant and independent cost functions. arXiv preprint arXiv:2003.09675 , 2020 . Nirupam Gupta and Nitin H Vaidya. Resilience in collaborative optimization: redundant and independent cost functions. arXiv preprint arXiv:2003.09675, 2020."},{"key":"e_1_3_2_1_17_1","volume-title":"Matrix analysis","author":"Horn Roger A","year":"1990","unstructured":"Roger A Horn , Roger A Horn , and Charles R Johnson . Matrix analysis . Cambridge university press , 1990 . Roger A Horn, Roger A Horn, and Charles R Johnson. Matrix analysis. Cambridge university press, 1990."},{"key":"e_1_3_2_1_18_1","volume-title":"Keith Bonawitz, Zachary Charles, Graham Cormode, Rachel Cummings, et al. Advances and open problems in federated learning. arXiv preprint arXiv:1912.04977","author":"Kairouz Peter","year":"2019","unstructured":"Peter Kairouz , H Brendan McMahan , Brendan Avent , Aur\u00e9lien Bellet , Mehdi Bennis , Arjun Nitin Bhagoji , Keith Bonawitz, Zachary Charles, Graham Cormode, Rachel Cummings, et al. Advances and open problems in federated learning. arXiv preprint arXiv:1912.04977 , 2019 . Peter Kairouz, H Brendan McMahan, Brendan Avent, Aur\u00e9lien Bellet, Mehdi Bennis, Arjun Nitin Bhagoji, Keith Bonawitz, Zachary Charles, Graham Cormode, Rachel Cummings, et al. Advances and open problems in federated learning. arXiv preprint arXiv:1912.04977, 2019."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_3_2_1_20_1","volume-title":"Distributed algorithms","author":"Lynch Nancy A","year":"1996","unstructured":"Nancy A Lynch . Distributed algorithms . Elsevier , 1996 . Nancy A Lynch. Distributed algorithms. Elsevier, 1996."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2016.2607420"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCPS.2014.6843720"},{"key":"e_1_3_2_1_24_1","volume-title":"Understanding the exploding gradient problem. CoRR, abs\/1211.5063, 2","author":"Pascanu Razvan","year":"2012","unstructured":"Razvan Pascanu , Tomas Mikolov , and Yoshua Bengio . Understanding the exploding gradient problem. CoRR, abs\/1211.5063, 2 , 2012 . Razvan Pascanu, Tomas Mikolov, and Yoshua Bengio. Understanding the exploding gradient problem. CoRR, abs\/1211.5063, 2, 2012."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/984622.984626"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2004.1428778"},{"key":"e_1_3_2_1_27_1","volume-title":"Principles of mathematical analysis","author":"Rudin Walter","year":"1964","unstructured":"Walter Rudin . Principles of mathematical analysis , volume 3 . McGraw-hill New York , 1964 . Walter Rudin. Principles of mathematical analysis, volume 3. McGraw-hill New York, 1964."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813687"},{"key":"e_1_3_2_1_29_1","volume-title":"Finite-time guarantees for Byzantine-resilient distributed state estimation with noisy measurements. arXiv preprint arXiv:1810.10086","author":"Su Lili","year":"2018","unstructured":"Lili Su and Shahin Shahrampour . Finite-time guarantees for Byzantine-resilient distributed state estimation with noisy measurements. arXiv preprint arXiv:1810.10086 , 2018 . Lili Su and Shahin Shahrampour. Finite-time guarantees for Byzantine-resilient distributed state estimation with noisy measurements. arXiv preprint arXiv:1810.10086, 2018."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933105"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53426-7_30"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49259-9_29"},{"key":"e_1_3_2_1_33_1","article-title":"Distributed optimization under adversarial nodes","author":"Sundaram Shreyas","year":"2018","unstructured":"Shreyas Sundaram and Bahman Gharesifard . Distributed optimization under adversarial nodes . IEEE Transactions on Automatic Control , 2018 . Shreyas Sundaram and Bahman Gharesifard. Distributed optimization under adversarial nodes. IEEE Transactions on Automatic Control, 2018.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"e_1_3_2_1_34_1","volume-title":"Generalized Byzantine-tolerant sgd. arXiv preprint arXiv:1802.10116","author":"Xie Cong","year":"2018","unstructured":"Cong Xie , Oluwasanmi Koyejo , and Indranil Gupta . Generalized Byzantine-tolerant sgd. arXiv preprint arXiv:1802.10116 , 2018 . Cong Xie, Oluwasanmi Koyejo, and Indranil Gupta. Generalized Byzantine-tolerant sgd. arXiv preprint arXiv:1802.10116, 2018."},{"key":"e_1_3_2_1_35_1","volume-title":"Byrdie: Byzantine-resilient distributed coordinate descent for decentralized learning","author":"Yang Zhixiong","year":"2017","unstructured":"Zhixiong Yang and Waheed U. Bajwa . Byrdie: Byzantine-resilient distributed coordinate descent for decentralized learning , 2017 . Zhixiong Yang and Waheed U. Bajwa. Byrdie: Byzantine-resilient distributed coordinate descent for decentralized learning, 2017."}],"event":{"name":"PODC '20: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Virtual Event Italy","acronym":"PODC '20"},"container-title":["Proceedings of the 39th Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3382734.3405748","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3382734.3405748","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3382734.3405748","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:50Z","timestamp":1750197770000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3382734.3405748"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,31]]},"references-count":35,"alternative-id":["10.1145\/3382734.3405748","10.1145\/3382734"],"URL":"https:\/\/doi.org\/10.1145\/3382734.3405748","relation":{},"subject":[],"published":{"date-parts":[[2020,7,31]]},"assertion":[{"value":"2020-07-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}