Person

Julien Michel Stainer

This person is no longer with EPFL

Related publications (6)

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.

Byzantine tolerant gradient descent for distributed machine learning with adversaries

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

The present application concerns a computer-implemented method for training a machine learning model in a distributed fashion, using Stochastic Gradient Descent, SGD, wherein the method is performed by a first computer in a distributed computing environmen ...

2019

The Disclosure Power of Shared Objects

Rachid Guerraoui, Mihail Igor Zablotchi, Julien Michel Stainer, Peva François Blanchard

Shared objects are the means by which processes gather and exchange information about the state of a distributed system. Objects that disclose more information about the system—and thus provide a more centralized view—are therefore more desirable. In this ...

2017

The Disclosure Power of Shared Objects

Rachid Guerraoui, Mihail Igor Zablotchi, Julien Michel Stainer, Peva François Blanchard

Shared objects are the means by which processes gather and exchange information about the state of a distributed system. Objects that disclose more information about the system are therefore more desirable. In this paper, we propose the schedule reconstruc ...

2017

, , ,

Establishing the scalability of a concurrent algorithm a priori, before implementing and evaluating it on a concrete multi-core platform, seems difficult, if not impossible. In the context of search data structures however, according to all practical work ...

Springer International Publishing2017

Brief Announcement: Byzantine-Tolerant Machine Learning

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

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 ...

ACM2017

, ,

The ability to identify people that share one's own interests is one of the most interesting promises of the Web 2.0 driving user-centric applications such as recommendation systems or collaborative marketplaces. To be truly useful, however, information ab ...

Elsevier Science Bv2013