Search Results for author:
Found 2 papers, 1 papers with code
Machine Learning with Adversaries: Byzantine Tolerant Gradient Descent
We propose \emph{Krum}, an aggregation rule that satisfies our resilience property, which we argue is the first provably Byzantine-resilient algorithm for distributed SGD.
Byzantine-Tolerant Machine Learning
The growth of data, the need for scalability and the complexity of models used in modern machine learning calls for distributed implementations.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
