多任务网络上的扩散LMS算法
Diffusion LMS over Multitask Networks
AI总结:
本文研究了在多任务环境中扩散LMS算法的性能,提出了一种无监督聚类策略以提升协作效率。
摘要:
近年来,扩散LMS算法在解决分布式优化问题方面得到了广泛研究。该高效策略允许节点协同估计单个参数向量。然而,实践中存在多任务导向的问题,即最优参数向量可能不相同。本文在单任务假设被违反的情况下,分析了扩散LMS的随机行为,并探讨了其在多任务环境中的性能。当条件被违反时,我们提出了一种无监督聚类策略,使节点能够通过自适应调整组合权重选择相似节点进行协作。仿真结果展示了理论成果和所提聚类策略的效率,并将框架应用于多目标跟踪任务。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。