Paper ID | SPTM-10.1 | ||
Paper Title | GRAMIAN-BASED ADAPTIVE COMBINATION POLICIES FOR DIFFUSION LEARNING OVER NETWORKS | ||
Authors | Y. Efe Erginbas, Bilkent University, Turkey; Stefan Vlaski, Ali H. Sayed, Ecole Polytechnique Fédérale de Lausanne (EPFL), Switzerland | ||
Session | SPTM-10: Distributed Learning over Graphs | ||
Location | Gather.Town | ||
Session Time: | Wednesday, 09 June, 14:00 - 14:45 | ||
Presentation Time: | Wednesday, 09 June, 14:00 - 14:45 | ||
Presentation | Poster | ||
Topic | Signal Processing Theory and Methods: [SIPG] Signal and Information Processing over Graphs | ||
IEEE Xplore Open Preview | Click here to view in IEEE Xplore | ||
Abstract | 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 designing combination policies that adjust the weights according to the quality of the data. Such policies are important because they would add a new degree of freedom and endow multi-agent systems with the ability to control the flow of information over their edges for enhanced performance. Most adaptive and static policies available in the literature optimize certain performance metrics related to steady-state behavior, to the detriment of transient behavior. In contrast, we develop an adaptive combination rule that aims at optimizing the transient learning performance, while maintaining the enhanced steady-state performance obtained using policies previously developed in the literature. |