Diffusion LMS Over Multitask Networks
From MaRDI portal
Publication:4580587
DOI10.1109/TSP.2015.2412918zbMATH Open1394.94113arXiv1404.6813MaRDI QIDQ4580587FDOQ4580587
Ali H. Sayed, Jie Chen, Cédric Richard
Publication date: 22 August 2018
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Abstract: The diffusion LMS algorithm has been extensively studied in recent years. This efficient strategy allows to address distributed optimization problems over networks in the case where nodes have to collaboratively estimate a single parameter vector. Problems of this type are referred to as single-task problems. Nevertheless, there are several problems in practice that are multitask-oriented in the sense that the optimum parameter vector may not be the same for every node. This brings up the issue of studying the performance of the diffusion LMS algorithm when it is run, either intentionally or unintentionally, in a multitask environment. In this paper, we conduct a theoretical analysis on the stochastic behavior of diffusion LMS in the case where the so-called single-task hypothesis is violated. We explain under what conditions diffusion LMS continues to deliver performance superior to non-cooperative strategies in the multitask environment. When the conditions are violated, we explain how to endow the nodes with the ability to cluster with other similar nodes to remove bias. We propose an unsupervised clustering strategy that allows each node to select, via adaptive adjustments of combination weights, the neighboring nodes with which it can collaborate to estimate a common parameter vector. Simulations are presented to illustrate the theoretical results, and to demonstrate the efficiency of the proposed clustering strategy. The framework is applied to a useful problem involving a multi-target tracking task.
Full work available at URL: https://arxiv.org/abs/1404.6813
Recommendations
- Diffusion LMS for Multitask Problems With Local Linear Equality Constraints
- Multitask Diffusion Adaptation Over Networks
- Multitask Diffusion Adaptation Over<?Pub _newline ?>Asynchronous Networks
- Diffusion Sparse Least-Mean Squares Over Networks
- Diffusion LMS Strategies for Distributed Estimation
- Distributed Adaptive Learning With Multiple Kernels in Diffusion Networks
- Diffusion Adaptation Strategies for Distributed Optimization and Learning Over Networks
- Diffusion logistic regression algorithms over multiagent networks
- Diffusion Information Theoretic Learning for Distributed Estimation Over Network
Cited In (8)
- Diffusion-probabilistic least mean square algorithm
- Distributed cooperative learning over time-varying random networks using a gossip-based communication protocol
- Robust multitask diffusion affine projection M-estimate algorithm: design and performance analysis
- Multitask Diffusion Adaptation Over<?Pub _newline ?>Asynchronous Networks
- Adaptive clustering based on element-wised distance for distributed estimation over multi-task networks
- Adaptive multitask clustering algorithm based on distributed diffusion least-mean-square estimation
- Distributed adaptive clustering learning over time-varying multitask networks
- Transient analysis of multitask learning over adaptive networks with wireless links
This page was built for publication: Diffusion LMS Over Multitask Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580587)