Publication

Brief Announcement: Byzantine-Tolerant Machine Learning

Rachid Guerraoui, El Mahdi El Mhamdi, Julien Michel Stainer, Peva François Blanchard
2017
Conference paper

Abstract

We report on \emph{Krum}, the first \emph{provably} Byzantine-tolerant aggregation rule for distributed Stochastic Gradient Descent (SGD). Krum guarantees the convergence of SGD even in a distributed setting where (asymptotically) up to half of the workers can be malicious adversaries trying to attack the learning system.

Official source

https://infoscience.epfl.ch/record/229311?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Brief Announcement: Byzantine-Tolerant Machine Learning

Graph Chatbot

Chat with Graph Search

Learning From Heterogeneous Data Based on Social Interactions Over Graphs

From event-based surprise to lifelong learning.A journey in the timescales of adaptation

Learnable Wavelet Transform and Domain Adversarial Learning for Enhanced Bearing Fault Diagnosis

Learning From Heterogeneous Data Based on Social Interactions Over Graphs

Learnable Wavelet Transform and Domain Adversarial Learning for Enhanced Bearing Fault Diagnosis

From event-based surprise to lifelong learning.A journey in the timescales of adaptation