Publication

Asynchronous Adaptation and Learning Over Networks—Part I: Modeling and Stability Analysis

Related publications (74)

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.

MATHICSE Technical Report : Quantifying uncertain system outputs via the multilevel Monte Carlo method – Part I: Central moment estimation

Fabio Nobile, Sebastian Krumscheid, Michele Pisaroni

In this work we introduce and analyze a novel multilevel Monte Carlo (MLMC) estimator for the accurate approximation of central moments of system outputs affected by uncertainties. Central moments play a central role in many disciplines to characterize a r ...

MATHICSE2017

Approximate Steepest Coordinate Descent

Martin Jaggi, Sebastian Urban Stich, Anant Raj

We propose a new selection rule for the coordinate selection in coordinate descent methods for huge-scale optimization. The efficiency of this novel scheme is provably better than the efficiency of uniformly random selection, and can reach the efficiency o ...

PMLR2017

Multitask Diffusion Adaptation Over Asynchronous Networks

Ali H. Sayed, Roula Nassif

The multitask diffusion LMS is an efficient strategy to simultaneously infer, in a collaborative manner, multiple parameter vectors. Existing works on multitask problems assume that all agents respond to data synchronously. In several applications, agents ...

IEEE2016

Resilience To Contagion In Financial Networks

Léo Hamed Amini

We derive rigorous asymptotic results for the magnitude of contagion in a large counterparty network and give an analytical expression for the asymptotic fraction of defaults, in terms of network characteristics. Our results extend previous studies on cont ...

Wiley-Blackwell2016

Amplitude And Phase Variation Of Point Processes

Victor Panaretos, Yoav Zemel

We develop a canonical framework for the study of the problem of registration of multiple point processes subjected to warping, known as the problem of separation of amplitude and phase variation. The amplitude variation of a real random function {Y(x) : x ...

Institute of Mathematical Statistics2016

On Polynomial Lieb–Robinson Bounds for the XY Chain in a Decaying Random Field

Marius Christopher Lemm

We consider the isotropic XY quantum spin chain in a random external field in the z direction, with single site distributions given by i.i.d. random variables times the critical decaying envelope j−1/2. Our motivation is the study of many-body localization ...

2016

Asynchronous Adaptation and Learning Over Networks—Part II: Performance Analysis

Ali H. Sayed

In Part I of this paper, also in this issue, we introduced a fairly general model for asynchronous events over adaptive networks including random topologies, random link failures, random data arrival times, and agents turning on and off randomly. We perfor ...

Institute of Electrical and Electronics Engineers2015

Asynchronous Adaptation and Learning Over Networks—Part III: Comparison Analysis

Ali H. Sayed

In Part II of this paper, also in this issue, we carried out a detailed mean-square-error analysis of the performance of asynchronous adaptation and learning over networks under a fairly general model for asynchronous events including random topologies, ra ...

Institute of Electrical and Electronics Engineers2015

Adaptive Networks

Ali H. Sayed

This paper surveys recent advances related to adaptation, learning, and optimization over networks. Various distributed strategies are discussed that enable a collection of networked agents to interact locally in response to streaming data and to continual ...

IEEE2014

Triangle Network Secrecy

Christina Fragouli, Suhas Diggavi, László Czap, Vinod Malathidevi Prabhakaran

We characterize the secret message capacity of the triangle network, that consists of a source, a relay and a destination connected through orthogonal erasure channels. A passive eavesdropper, Eve, wiretaps any one of the three channels. The source and the ...

Ieee2014