Abstract
We consider a private distributed online optimization problem where a set of agents aim to minimize the sum of locally convex cost functions while each desires that the local cost function of individual agent is kept differentially private. To solve such problem, we propose differentially private distributed stochastic subgradient online optimization algorithm over time-varying directed networks. We use differential privacy to preserve the privacy of participating agents. We show that our algorithm preserves differential privacy and achieves logarithmic expected regret under locally strong convexity. Moreover, we also show that square-root expected regret is obtained under local convexity. Furthermore, we reveal the tradeoff between the privacy level and the performance of our 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 callMore From: IEEE Transactions on Signal and Information Processing over Networks
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.
