Adaptation, Learning, and Optimization over Networks
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.
This work studies the learning abilities of agents sharing partial beliefs over social networks. The agents observe data that could have risen from one of several hypotheses and interact locally to decide whether the observations they are receiving have ri ...
Adaptation and learning over multi-agent networks is a topic of great relevance with important implications. Elaborating on previous works on single-task networks engaged in decision problems, here we consider the multi-task version in the challenging scen ...
This paper studies the problem of inferring whether an agent is directly influenced by another agent over a network. Agent i influences agent j if they are connected (according to the network topology), and if agent j uses the data from agent i to update i ...
We consider learning of fundamental properties of communities in large noisy networks, in the prototypical situation where the nodes or users are split into two classes according to a binary property, e.g., according to their opinions or preferences on a t ...
Toward industry 4.0, modern manufacturing companies are aiming at building digital twins to manage physical assets, processes, people, and places. Since in this environment, massive amounts of data have been generated and collected, integration and managem ...
Text summarization is considered as a challenging task in the NLP community. The availability of datasets for the task of multilingual text summarization is rare, and such datasets are difficult to construct. In this work, we
build an abstract text summari ...
Association for Computational Linguistics (ACL)2019
Percolation, in its most general interpretation, refers to the “flow” of something (a physical agent, data or information) in a network, possibly accompanied by some nonlinear dynamical processes on the network nodes (sometimes denoted reaction–diffusion s ...
We study model-free learning methods for the output-feedback Linear Quadratic (LQ) control problem in finite-horizon subject to subspace constraints on the control policy. Subspace constraints naturally arise in the field of distributed control and present ...
We consider a distributed social learning problem where a network of agents is interested in selecting one among a finite number of hypotheses. The data collected by the agents might be heterogeneous, meaning that different sub-networks might observe data ...
This work presents and studies a distributed algorithm for solving optimization problems over networks where agents have individual costs to minimize subject to subspace constraints that require the minimizers across the network to lie in a low-dimensional ...
