Abstract
This paper 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. Firstly, a function-decomposition-based privacy-preserving method is provided to preserve the private subgradient information of each node, which can guarantee both the privacy preservation and the convergence accuracy. Then, a privacy-preserving distributed online stochastic optimization algorithm is proposed based on 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
