.png){kind=icon}
Return
Differentially private distributed online mirror descent algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2023.126531.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper examines a private distributed online convex optimization problem in which each agent strives to minimize the sum of objective functions while also tending to keep their individual objective functions confidential. We use differential privacy as the metric to safeguard each agent's privacy and offer a distributed online mirror descent technique that is differentially private. We demonstrate that for strongly convex objective functions, our proposed algorithm satisfies the expected regret bound of O(ln (T)) while maintaining differential privacy, where T is the number of iterations. The established expected regret bound matches the optimal theoretical regret bound with respect to T. We further illu-minate the trade-off between the extent of privacy-preserving and the expected regret bound through numerical simulations.& COPY; 2023 Elsevier B.V. All rights reserved.
Keywords:
Differential privacy
Distributed online optimization
Mirror descent
Expected regret
Strongly convex
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W
Organization
Cited Papers
ShareSave
Distributed optimization of first-order discrete-time multi-agent systems with event-triggered communication.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
ShareSaveShareSaveShareSaveShareSaveShareSaveIndividual Regret Bounds for the Distributed Online Alternating Direction Method of Multipliers
PREAI
ShareSave
View more