Publication

Asynchronous diffusion adaptation over networks

Related publications (40)

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.

Asynchronous adaptive networks

Ali H. Sayed

In a recent article [1] we surveyed advances related to adaptation, learning, and optimization over synchronous networks. Various distributed strategies were discussed that enable a collection of networked agents to interact locally in response to streamin ...

Elsevier2018

Multilevel tensor approximation of PDEs with random data

Daniel Kressner, Jonas Ballani, Michael Dieter Peters

In this paper, we introduce and analyze a new low-rank multilevel strategy for the solution of random diffusion problems. Using a standard stochastic collocation scheme, we first approximate the infinite dimensional random problem by a deterministic parame ...

Springer2017

MATHICSE Technical Report : Multilevel tensor approximation of PDEs with random data

Daniel Kressner, Jonas Ballani, Michael Dieter Peters

MATHICSE2016

Multi-index Stochastic Collocation for random PDEs

Fabio Nobile, Lorenzo Tamellini

In this work we introduce the Multi-Index Stochastic Collocation method (MISC) for computing statistics of the solution of a PDE with random data. MISC is a combination technique based on mixed differences of spatial approximations and quadratures over the ...

2016

Local trapping for elliptic random walks in random environments in Z(d)

Daniel Kious

We consider elliptic random walks in i.i.d. random environments on . The main goal of this paper is to study under which ellipticity conditions local trapping occurs. Our main result is to exhibit an ellipticity criterion for ballistic behavior which exten ...

Springer Heidelberg2016

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

Ali H. Sayed

In this work and the supporting Parts II and III of this paper, also in the current issue, we provide a rather detailed analysis of the stability and performance of asynchronous strategies for solving distributed optimization and adaptation problems over n ...

Institute of Electrical and Electronics Engineers2015

MATHICSE Technical Report : Multi-index stochastic collocation for random PDEs

Fabio Nobile, Lorenzo Tamellini

MATHICSE2015

Error Analysis of the Dynamically Orthogonal Approximation of Time Dependent Random PDEs

Fabio Nobile, Eleonora Musharbash

In this work we discuss the dynamically orthogonal (DO) approximation of time dependent partial differential equations with random data. The approximate solution is expanded at each time instant on a time dependent orthonormal basis in the physical domain ...

2015

Incentive Schemes for Participatory Sensing

Boi Faltings, Goran Radanovic

We consider a participatory sensing scenario where a group of private sensors observes the same phenomenon, such as air pollution. Since sensors need to be installed and maintained, owners of sensors are inclined to provide inaccurate or random data. We de ...

2015

Reducing Randomness in Matrix Models for Wireless Communication

Marc Desgroseilliers

Pushed by the proliferation of antennas and of multiuser scenarios, matrices with random entries are appearing more and more frequently in information theory. This leads to the study of matrix channels, where the capacity depends on the distribution of the ...

EPFL2015