Journal
IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS
Volume 10, Issue 2, Pages 1069-1082Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCNS.2022.3219765
Keywords
Distributed online optimization; privacy preservation; regret analysis; stochastic optimization; time-varying distributions
Ask authors/readers for more resources
This article investigates privacy-preserving distributed online stochastic optimization problem with random parameters following time-varying distributions. A method based on function decomposition is proposed to preserve the private subgradient information of each node, while ensuring privacy preservation and convergence accuracy. A privacy-preserving distributed online stochastic optimization algorithm is then proposed based on the primal-dual method. Numerical simulation results demonstrate the effectiveness of the proposed algorithm.
This article investigates the privacy-preserving distributed online stochastic optimization problem with random parameters following time-varying distributions, where a set of nodes cooperatively minimize a sum of expectation-valued local cost functions subject to coupled constraints. First, a function-decomposition-based privacy-preserving method is provided to preserve the private subgradient information of each node, which can guarantee both privacy preservation and convergence accuracy. Then, a privacy-preserving distributed online stochastic optimization algorithm is proposed based on the primal-dual method. It is proved that the dynamic regret and the constraint violation are sublinear. The relationship of the dynamic regret between before and after function decomposition is provided, and so is the constraint violation. Finally, a numerical simulation is provided to demonstrate the effectiveness of the proposed algorithm.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available