Publications by Ali H. Sayed | EPFL Graph Search

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.

This paper studies the non-Asymptotic classification performance of the social machine learning strategy. This strategy involves an independent training phase followed by a cooperative inference phase to classify a growing number of samples. By considering ...

In social learning, agents form their opinions or beliefs about certain hypotheses by exchanging local information. This work considers the recent paradigm of weak graphs, where the network is partitioned into sending and receiving components, with the for ...

Communication-constrained algorithms for decentralized learning and optimization rely on the exchange of quantized signals coupled with local updates. In this context, differential quantization is an effective technique to mitigate the negative impact of q ...

Social learning algorithms provide models for the formation of opinions over social networks resulting from local reasoning and peer-to-peer exchanges. Interactions occur over an underlying graph topology, which describes the flow of information among the ...

Most available studies on distributed GAN architectures focus on implementations with a fusion center. In this work, we propose a fully decentralized scheme by employing a diffusion strategy to train a network of GANs. We interpret the training procedure a ...

We address the challenge of learning factored policies in cooperative MARL scenarios. In particular, we consider the situation in which a team of agents collaborates to optimize a common cost. The goal is to obtain factored policies that determine the indi ...

In this paper, we develop a stochastic-gradient learning algorithm for situations involving streaming data that arise from an underlying clustered structure. In such settings, the variance of gradient noise can be decomposed into the in-cluster variance si ...

This paper formulates a multitask optimization problem where agents in the network have individual objectives to meet, or individual parameter vectors to estimate, subject to a smoothness condition over the graph. The smoothness condition softens the trans ...

This work develops a fully decentralized variance-reduced learning algorithm for multi-agent networks where nodes store and process the data locally and are only allowed to communicate with their immediate neighbors. In the proposed algorithm, there is no ...

We consider multi-agent networks that aim at solving, cooperatively and online, distributed optimization problems under communication constraints. We propose the ACTC (Adapt-Compress-Then-Combine) diffusion strategy, which leverages differential randomized ...

We consider a distributed binary hypothesis testing setup where multiple nodes send quantized information to a central processor, which is oblivious to the nodes' statistics. We study the regime where the missed detection (type-II error) probability decays ...

Rapid advances in data collection and processing capabilities have allowed for the use of increasingly complex models that give rise to nonconvex optimization problems. These formulations, however, can be arbitrarily difficult to solve in general, in the s ...

This work examines the problem of learning the topology of a network (graph learning) from the signals produced at a subset of the network nodes (partial observability). This challenging problem was recently tackled assuming that the topology is drawn acco ...

In important applications involving multi-task networks with multiple objectives, agents in the network need to decide between these multiple objectives and reach an agreement about which single objective to follow for the network. In this work we propose ...

This article proposes an exploration technique for multiagent reinforcement learning (MARL) with graph-based communication among agents. We assume that the individual rewards received by the agents are independent of the actions by the other agents, while ...

Non-Bayesian social learning is a framework for distributed hypothesis testing aimed at learning the true state of the environment. Traditionally, the agents are assumed to receive observations conditioned on the same true state, although it is also possib ...

This work focuses on the development of a new family of decision-making algorithms for adaptation and learning, which are specifically tailored to decision problems and are constructed by building up on first principles from decision theory. A key observat ...

We study a social learning scheme where at every time instant, each agent chooses to receive information from one of its neighbors at random. We show that under this sparser communication scheme, the agents learn the truth eventually and the asymptotic con ...

Part & x00A0;I of this paper considered optimization problems over networks where agents have individual objectives to meet, or individual parameter vectors to estimate, subject to subspace constraints that require the objectives across the network to lie ...

Recently, the diffusion moving-average (D-MA) scheme has been proposed as a way to combat noisy links over adaptive networks. However, the current theoretical results focus on networks with mean-square error costs where the optimal local solution agrees wi ...

Ali H. Sayed

Chat with Graph Search

Performance of Social Machine Learning under Limited Data

Learning Graph Influence From Social Interactions

Differential Error Feedback for Communication-Efficient Decentralized Optimization

Explainability and Graph Learning From Social Interactions

Decentralized Gan Training Through Diffusion Learning

Logical Team Q-learning: An approach towards factored policies in cooperative MARL

Cover: A Cluster-Based Variance Reduced Method For Online Learning

Learning Over Multitask Graphs-Part I: Stability Analysis

Efficient Variance-Reduced Learning Over Multi-Agent Networks

Adaptive Diffusion With Compressed Communication

A Fundamental Limit of Distributed Hypothesis Testing Under Memoryless Quantization

Second-order guarantees in centralized, federated and decentralized nonconvex optimization

Learning Bollobas-Riordan Graphs Under Partial Observability

Decentralized Decision-Making Over Multi-Task Networks

Graph Exploration for Effective Multiagent Q-Learning

Detection of Malicious Agents in Social Learning

Decision-making algorithms for learning and adaptation with application to COVID-19 data

Social Learning under Randomized Collaborations

Adaptation and Learning Over Networks Under Subspace Constraints & x2014;Part II: Performance Analysis

Diffusion Moving-Average Adaptation Over Networks