Differentially private cloud-based multi-agent optimization with constraints

We present an optimization framework that solves constrained multi-agent optimization problems while keeping each agent's state differentially private. The agents in the network seek to optimize a local objective function in the presence of global constraints. Agents communicate only through a trusted cloud computer and the cloud also performs computations based on global information. The cloud computer modifies the results of such computations before they are sent to the agents in order to guarantee that the agents' states are kept private. We show that under mild conditions each agent's optimization problem converges in mean-square to its unique solution while each agent's state is kept differentially private. A numerical simulation is provided to demonstrate the viability of this approach.

[1]  George Kesidis,et al.  Incentive-Based Energy Consumption Scheduling Algorithms for the Smart Grid , 2010, 2010 First IEEE International Conference on Smart Grid Communications.

[2]  Bhaskar Krishnamachari,et al.  Sensor network algorithms and applications , 2012, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[3]  Aaron Roth,et al.  The Algorithmic Foundations of Differential Privacy , 2014, Found. Trends Theor. Comput. Sci..

[4]  Moni Naor,et al.  Our Data, Ourselves: Privacy Via Distributed Noise Generation , 2006, EUROCRYPT.

[5]  Magnus Egerstedt,et al.  Cloud-based optimization: A quasi-decentralized approach to multi-agent coordination , 2014, 53rd IEEE Conference on Decision and Control.

[6]  V. S. Anil Kumar,et al.  Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.

[7]  A. Robert Calderbank,et al.  Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures , 2007, Proceedings of the IEEE.

[8]  Ufuk Topcu,et al.  Differentially private convex optimization with piecewise affine objectives , 2014, 53rd IEEE Conference on Decision and Control.

[9]  George J. Pappas,et al.  Differentially Private Filtering , 2012, IEEE Transactions on Automatic Control.

[10]  Mac Schwager,et al.  Decentralized path planning for coverage tasks using gradient descent adaptive control , 2014, Int. J. Robotics Res..

[11]  Tim Roughgarden,et al.  Privately Solving Linear Programs , 2014, ICALP.

[12]  Benoît Chachuat,et al.  Nonlinear and Dynamic Optimization: From Theory to Practice , 2007 .

[13]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[14]  Asuman E. Ozdaglar,et al.  Constrained Consensus and Optimization in Multi-Agent Networks , 2008, IEEE Transactions on Automatic Control.

[15]  B. T. Poljak.  Nonlinear programming methods in the presence of noise , 1978, Math. Program..

[16]  Asuman E. Ozdaglar,et al.  Distributed Subgradient Methods for Multi-Agent Optimization , 2009, IEEE Transactions on Automatic Control.

[17]  Zhenqi Huang,et al.  Differentially Private Distributed Optimization , 2014, ICDCN.

[18]  Cynthia Dwork,et al.  Differential Privacy , 2006, ICALP.

[19]  H. Uzawa,et al.  The Kuhn-Tucker Theorem in Concave Programming , 2014 .