Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2501.04222 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916556043190272 |
|---|---|
| author | Zhou, Yingjie Li, Tao |
| author_facet | Zhou, Yingjie Li, Tao |
| contents | We investigate the distributed online nonconvex optimization problem with differential privacy over time-varying networks. Each node minimizes the sum of several nonconvex functions while preserving the node's differential privacy. We propose a privacy-preserving distributed online mirror descent algorithm for nonconvex optimization, which uses the mirror descent to update decision variables and the Laplace differential privacy mechanism to protect privacy. Unlike the existing works, the proposed algorithm allows the cost functions to be nonconvex, which is more applicable. Based upon these, we prove that if the communication network is $B$-strongly connected and the constraint set is compact, then by choosing the step size properly, the algorithm guarantees $ε$-differential privacy at each time. Furthermore, we prove that if the local cost functions are $β$-smooth, then the regret over time horizon $T$ grows sublinearly while preserving differential privacy, with an upper bound $O(\sqrt{T})$. Finally, the effectiveness of the algorithm is demonstrated through numerical simulations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_04222 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Privacy-Preserving Distributed Online Mirror Descent for Nonconvex Optimization Zhou, Yingjie Li, Tao Systems and Control We investigate the distributed online nonconvex optimization problem with differential privacy over time-varying networks. Each node minimizes the sum of several nonconvex functions while preserving the node's differential privacy. We propose a privacy-preserving distributed online mirror descent algorithm for nonconvex optimization, which uses the mirror descent to update decision variables and the Laplace differential privacy mechanism to protect privacy. Unlike the existing works, the proposed algorithm allows the cost functions to be nonconvex, which is more applicable. Based upon these, we prove that if the communication network is $B$-strongly connected and the constraint set is compact, then by choosing the step size properly, the algorithm guarantees $ε$-differential privacy at each time. Furthermore, we prove that if the local cost functions are $β$-smooth, then the regret over time horizon $T$ grows sublinearly while preserving differential privacy, with an upper bound $O(\sqrt{T})$. Finally, the effectiveness of the algorithm is demonstrated through numerical simulations. |
| title | Privacy-Preserving Distributed Online Mirror Descent for Nonconvex Optimization |
| topic | Systems and Control |
| url | https://arxiv.org/abs/2501.04222 |