Genuinely distributed Byzantine machine learning

DOI10.1007/s00446-022-00427-9OpenAlexW3033966392MaRDI QIDQ2166362

Rachid Guerraoui, El-Mahdi El-Mhamdi, Arsany Guirguis, Sébastien Rouault, Lê Nguyên Hoang

Publication date: 24 August 2022

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-022-00427-9

zbMATH Keywords

Byzantine fault tolerancedistributed machine learningByzantine parameter serversrobust machine learning

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multidimensional agreement in Byzantine systems
• Introduction to Reliable and Secure Distributed Programming
• Reaching approximate agreement in the presence of faults
• Impossibility of distributed consensus with one faulty process
• The Byzantine Generals Problem
• Robustly Learning a Gaussian: Getting Optimal Error, Efficiently
• Are Loss Functions All the Same?
• Finite-Time Guarantees for Byzantine-Resilient Distributed State Estimation With Noisy Measurements
• Learning representations by back-propagating errors
• Brief Announcement
• Principles of Distributed Systems
• Genuinely Distributed Byzantine Machine Learning

This page was built for publication: Genuinely distributed Byzantine machine learning