Distributed Clustering for Secure Multi-Task Estimation Based on Adaptive Task-Switching
Consider adversarial multi-task networks with a high cost of sharing genuine information, where agents feed others unreliable information according to a time-varying probability caused by a high privacy cost. This makes agents in the network tend to be selfish, and it greatly increases the difficult...
Saved in:
Published in | IEEE transactions on aerospace and electronic systems pp. 1 - 12 |
---|---|
Main Authors | , , , , |
Format | Journal Article |
Language | English |
Published |
IEEE
02.05.2023
|
Subjects | |
Online Access | Get full text |
ISSN | 0018-9251 |
DOI | 10.1109/TAES.2023.3272869 |
Cover
Summary: | Consider adversarial multi-task networks with a high cost of sharing genuine information, where agents feed others unreliable information according to a time-varying probability caused by a high privacy cost. This makes agents in the network tend to be selfish, and it greatly increases the difficulty of effective information sharing and distributed multi-task estimation without the prior cluster information. To address these problems, we propose an adaptive task-switching strategy that is governed by our formulated information sharing model, which cooperates with the proposed DATSLCS-AM algorithm. This distributed algorithm guides agents to cooperate reasonably following reputation updating and pseudo-clustering, which can improve the effectiveness of information sharing and also increase the security of estimation over adversarial multi-task networks. The theoretical analysis of the adaptive pseudo-clustering threshold is provided. Finally, extensive simulations validate the superior performance of our distributed algorithm. |
---|---|
ISSN: | 0018-9251 |
DOI: | 10.1109/TAES.2023.3272869 |