Abstract
The design of distributed optimization algorithms for intelligent Internet of Thing (IIoT) environments has attracted extensive attention. However, the dynamic network environment, the delay of information transmission between devices and the risk of privacy disclosure pose great challenges to algorithm designs. To address this problem, we propose a distributed gradient descent algorithm, which can converge under very mild assumptions that there will be an unbounded (stochastic) delay from sender to receiver. To the best of our knowledge, our proposed algorithm is the first work to take unbounded stochastic communication delays into consideration, in addition to time-varying networks and privacy disclosure. Rigorous analysis shows that our algorithm can converge under such mild assumptions. Extensive experiments exhibit that the proposed algorithm performs well in complex IIoT environments.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.