arrow
返回

Privacy Masking Stochastic Subgradient-Push Algorithm for Distributed Online Optimization

delete2021-06-01
delete48
PRE
AI
Q
Qingguo Lü
廖晓峰 (Xiaofeng Liao) *
向涛 (Tao Xiang)
H
Huaqing Li
T
Tingwen Huang
DOI:10.1109/TCYB.2020.2973221delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
This article investigates the problem of distributed online optimization for a group of units communicating on time-varying unbalanced directed networks. The main target of the set of units is to cooperatively minimize the sum of all locally known convex cost functions (global cost function) while pursuing the privacy of their local cost functions being well masked. To address such optimization problems in a collaborative and distributed fashion, a differentially private-distributed stochastic subgradient-push algorithm, called DP-DSSP, is proposed, which ensures that units interact with in-neighbors and collectively optimize the global cost function. Unlike most of the existing distributed algorithms which do not consider privacy issues, DP-DSSP via differential privacy strategy successfully masks the privacy of participating units, which is more practical in applications involving sensitive messages, such as military affairs or medical treatment. An important feature of DP-DSSP is tackling distributed online optimization problems under the circumstance of time-varying unbalanced directed networks. Theoretical analysis indicates that DP-DSSP can effectively mask differential privacy as well as can achieve sublinear regrets. A compromise between the privacy levels and the accuracy of DP-DSSP is also revealed. Furthermore, DP-DSSP is capable of handling arbitrarily large but uniformly bounded delays in the communication links. Finally, simulation experiments confirm the practicability of DP-DSSP and the findings in this article.
Keyword:
Privacy
Cost function
Convex functions
Delays
Stochastic processes
Communication delays
differential privacy
distributed online optimization
stochastic subgradient-push algorithm
time-varying directed networks
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Transactions on Cybernetics 封面图
IEEE Transactions on Cybernetics
IF:
10.5
论文数:
1.1W
被引数:
5.0W

机构

S
southwest university - china
学者数:
2.6W
论文数: 1.9W
被引数: 21
C
Chongqing University
学者数:
5.1W
论文数: 4.1W
被引数: 6.0W
Q
qatar foundation (qf)
学者数:
6.3K
论文数: 7.0K
被引数: 8
学者 查看更多机构
引用论文

引用论文

A Distributed Algorithm for Economic Dispatch Over Time-Varying Directed Networks With Delays
err2017-06-01
err195
PREAI
errYang, Tao; Lu, Jie; Wu, Di; Wu, Junfeng; Shi, Guodong; Meng, Ziyang; Johansson, Karl Henrik
err分享
err收藏
Adaptive Controller Tuning Method Based on Online Multiobjective Optimization: A Case Study of the Four-Bar Mechanism
err2021-03-01
err13
PREAI
errRodriguez-Molina, Alejandro; Villarreal-Cervantes, Miguel G.; Mezura-Montes, Efren; Aldape-Perez, Mario
err分享
err收藏
An Incentive-Based Online Optimization Framework for Distribution Grids
err2018-07-01
err83
errOAAI
errZhou, Xinyang; Dall'Anese, Emiliano; Chen, Lijun; Simonetto, Andrea
err分享
err收藏
err分享
err收藏
学者 查看更多内容