The DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
Diffusion LMS Over Multitask Networks
Open accessAbstract
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. 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 single-task hypothesis is violated. We analyze the competing factors that influence the performance of diffusion LMS in the multitask environment, and which allow the algorithm to continue to deliver performance superior to non-cooperative strategies in some useful circumstances. We also 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Distributed Subgradient Methods for Multi-Agent Optimization
Nedic, A., & Ozdaglar, A. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.2009515 · Cited by 3,719
Fast linear iterations for distributed averaging
Xiao, L., & Boyd, S. (2004) · Systems & Control Letters · doi:10.1016/j.sysconle.2004.02.022 · Cited by 2,706
Matrix Mathematics: Theory, Facts, and Formulas (Second Edition)
Bernstein, D. S. (2009) · Princeton University Press eBooks · doi:10.1515/9781400833344 · Cited by 1,324
Diffusion LMS Strategies for Distributed Estimation
Cattivelli, F. S., & Sayed, A. H. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2033729 · Cited by 1,174
Self-citationDiffusion Least-Mean Squares Over Adaptive Networks: Formulation and Performance Analysis
Lopes, C. G., & Sayed, A. H. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.917383 · Cited by 1,109
Self-citationSayed, A. H. (2008) · Wiley eBooks · doi:10.1002/9780470374122 · Cited by 848
Self-citationGossip Algorithms for Distributed Signal Processing
Dimakis, A. G., Kar, S., Moura, J. M. F., Rabbat, M. G., & Scaglione, A. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2052531 · Cited by 741
Incremental Adaptive Strategies Over Distributed Networks
Lopes, C. G., & Sayed, A. H. (2007) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.896034 · Cited by 732
Self-citationGossip Algorithms for Distributed Signal Processing
Dimakis, A. G., Kar, S., Moura, J. M. F., Rabbat, M., & Scaglione, A. (2018) · doi:10.1184/r1/6468842.v1 · Cited by 692
Cited by
Communication-efficient distributed learning: An overview
Cao, X., Başar, T., Diggavi, S., Eldar, Y. C., Letaief, K. B., Poor, H. V., & Zhang, J. (2023) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2023.3242710 · Cited by 139
Metadata
- Authors
- Chen, J., Richard, C., & Sayed, A. H.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2015-06
- Volume
- 63
- Issue
- 11
- Pages
- 2733-2748
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2093795816
- Cited by
- 253
- References
- 48
- FWCI
- 27.42
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Diffusion LMS Over Multitask Networks. https://app.cochat.ai/papers/10.1109/tsp.2015.2412918
- The paper
- Chen, J., Richard, C., & Sayed, A. H. (2015). Diffusion LMS Over Multitask Networks. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2015.2412918
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.