.png){kind=icon}
.png){kind=icon}
Return
Cloud-Enabled Differentially Private Multiagent Optimization With Constraints
.png){kind=icon}
OA
AI
DOI：10.1109/TCNS.2017.2751458.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present an optimization framework for solving multiagent convex programs subject to inequality constraints while keeping the agents' state trajectories private. Each agent has an objective function depending only upon its own state and the agents are collectively subject to global constraints. The agents do not directly communicate with each other but instead route messages through a trusted cloud computer. The cloud adds noise to data being sent to the agents in accordance with the framework of differential privacy and, thus, keeps each agent's state trajectory private from all other agents and any eavesdroppers. This private problem can be viewed as a stochastic variational inequality, and it is solved using a projection-based method for solving variational inequalities that resemble a noisy primal-dual gradient algorithm. Convergence of the optimization algorithm in the presence of noise is proven, and a quantifiable tradeoff between privacy and convergence is extracted from this proof. Simulation results are provided that demonstrate numerical convergence for both epsilon-differential privacy and (epsilon, delta)-differential privacy.
Keywords:
Data privacy
decentralized control
networked control systems
optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5
Papers:
1.6K
Citations:
5.8K
