Concept

Intelligence artificielle distribuée

Publications associées (161)

Algorithms for Efficient and Robust Distributed Deep Learning

The success of deep learning may be attributed in large part to remarkable growth in the size and complexity of deep neural networks. However, present learning systems raise significant efficiency concerns and privacy: (1) currently, training systems are l ...

EPFL2022

Deep Q-learning agent for building earthquake resisting wall

Katrin Beyer, Qianqing Wang, Ketson Roberto Maximiano Dos Santos

The construction of dry-joint brick masonry that is subject to seismic loading can be modelled as a strategy problem wherein bricks must be laid to form a load resisting structure. To learn how to mount bricks while considering relevant engineering criteri ...

2022

Generating Higher-Fidelity Synthetic Datasets with Privacy Guarantees

Boi Faltings, Aleksei Triastcyn

We consider the problem of enhancing user privacy in common data analysis and machine learning development tasks, such as data annotation and inspection, by substituting the real data with samples from a generative adversarial network. We propose employing ...

MDPI2022

Finite Bit Quantization For Decentralized Learning Under Subspace Constraints

Ali H. Sayed, Stefan Vlaski, Roula Nassif, Marco Carpentiero

In this paper, we consider decentralized optimization problems where agents have individual cost functions to minimize subject to subspace constraints that require the minimizers across the network to lie in low-dimensional subspaces. This constrained form ...

IEEE2022

Dalton: Learned Partitioning for Distributed Data Streams

Anastasia Ailamaki, Eleni Zapridou, Ioannis Mytilinis

To sustain the input rate of high-throughput streams, modern stream processing systems rely on parallel execution. However, skewed data yield imbalanced load assignments and create stragglers that hinder scalability. Deciding on a static partitioning for a ...

2022

A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness

Tony Alan Wood

Solving the Lexicographic Bottleneck Assignment Problem (LexBAP) typically relies on centralised computation with order complexity. We consider the Sequential Bottleneck Assignment Problem (SeqBAP), which yields a greedy solution to the LexBAP and discuss ...

Elsevier2022

Decentralized Semi-supervised Learning over Multitask Graphs

Ali H. Sayed, Roula Nassif, Elsa Rizk

In network semi-supervised learning problems, only a subset of the network nodes is able to access the data labeling. This paper formulates a decentralized optimization problem where agents have individual decision rules to estimate, subject to the conditi ...

IEEE2022

Distributed Learning in Non-Convex Environments-Part II: Polynomial Escape From Saddle-Points

Ali H. Sayed, Stefan Vlaski

The diffusion strategy for distributed learning from streaming data employs local stochastic gradient updates along with exchange of iterates over neighborhoods. In Part I [3] of this work we established that agents cluster around a network centroid and pr ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Critical Parameters for Scalable Distributed Learning with Large Batches and Asynchronous Updates

Martin Jaggi, Sebastian Urban Stich, Amirkeivan Mohtashami

It has been experimentally observed that the efficiency of distributed training with stochastic gradient (SGD) depends decisively on the batch size and—in asynchronous implementations—on the gradient staleness. Especially, it has been observed that the spe ...

2021

Gramian-Based Adaptive Combination Policies For Diffusion Learning Over Networks

Ali H. Sayed, Stefan Vlaski, Yigit Efe Erginbas

This paper presents an adaptive combination strategy for distributed learning over diffusion networks. Since learning relies on the collaborative processing of the stochastic information at the dispersed agents, the overall performance can be improved by d ...

IEEE2021

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search