arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.14514math.OCcs.CRcs.LG
收藏

差分私有分布式凸优化

Differentially Private Distributed Convex Optimization

Argonne National Laboratory(阿贡国家实验室)

Minseok Ryu, Kibaek Kim

摘要:

本文考虑分布式优化(DO),多个代理合作,以最小化一个全球目标函数,表示为一个地方的目标,受到一些限制。在DO中,每个代理迭代地求解由其自己的数据构造的局部最优化模型,并传达一些信息(例如,局部解),直到获得全局解。即使本地存储的数据不与其他代理共享,仍然可以从代理之间通信的信息重建数据,这可能限制DO在具有敏感数据的应用中的实际使用。为了解决这个问题,我们提出了一个隐私保护的DO算法的约束凸优化模型,它提供了一个数据隐私的统计保证,称为差分隐私,和一个序列的迭代收敛到一个最优解的期望。该算法推广了线性化的交替方向法的乘法器,通过引入多个本地更新技术,以减少通信成本,并将一个客观的扰动法的局部最优化模型计算和通信的随机可行的本地解决方案,不能被用来重建本地数据,从而保护数据隐私。在凸约束的存在下,我们表明,虽然这两种算法提供了相同水平的数据隐私,所提出的算法中使用的客观扰动可以提供更好的解决方案比广泛采用的输出扰动法,随机化的局部解决方案,通过添加一些噪声。我们提出的隐私和收敛性分析的细节,并通过将其应用于两个不同的应用程序,即分布式控制的潮流和联邦学习,数据隐私是关注的数值证明了该算法的有效性。

英文摘要:

This paper considers distributed optimization (DO) where multiple agents cooperate to minimize a global objective function, expressed as a sum of local objectives, subject to some constraints. In DO, each agent iteratively solves a local optimization model constructed by its own data and communicates some information (e.g., a local solution) with its neighbors until a global solution is obtained. Even though locally stored data are not shared with other agents, it is still possible to reconstruct the data from the information communicated among agents, which could limit the practical usage of DO in applications with sensitive data. To address this issue, we propose a privacy-preserving DO algorithm for constrained convex optimization models, which provides a statistical guarantee of data privacy, known as differential privacy, and a sequence of iterates that converges to an optimal solution in expectation. The proposed algorithm generalizes a linearized alternating direction method of multipliers by introducing a multiple local updates technique to reduce communication costs and incorporating an objective perturbation method in the local optimization models to compute and communicate randomized feasible local solutions that cannot be utilized to reconstruct the local data, thus preserving data privacy. Under the existence of convex constraints, we show that, while both algorithms provide the same level of data privacy, the objective perturbation used in the proposed algorithm can provide better solutions than does the widely adopted output perturbation method that randomizes the local solutions by adding some noise. We present the details of privacy and convergence analyses and numerically demonstrate the effectiveness of the proposed algorithm by applying it in two different applications, namely, distributed control of power flow and federated learning, where data privacy is of concern.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑