Cloud-Enabled Differentially Private Multi-Agent Optimization with Constraints
Matthew Hale, Magnus Egerstedt

TL;DR
This paper introduces a privacy-preserving multi-agent optimization framework that uses differential privacy via a cloud-based noisy communication scheme, ensuring agents' trajectories remain confidential while solving constrained nonlinear programs.
Contribution
The paper proposes a novel cloud-enabled optimization method that guarantees differential privacy for multi-agent systems with convergence proofs and privacy-accuracy trade-offs.
Findings
Convergence is proven despite the added noise.
The framework supports both ε- and (ε, δ)-differential privacy.
Simulation results confirm practical convergence and privacy guarantees.
Abstract
We present an optimization framework for solving multi-agent nonlinear 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 computer adds noise to data being sent to the agents in accordance with the framework of differential privacy in order to keep 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 is solved using a projection-based method for solving variational inequalities that resembles a noisy primal-dual gradient algorithm. Convergence of the optimization algorithm in the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
