核心概念
Developing a differentially private dual gradient tracking algorithm for secure distributed resource allocation.
要約
The paper explores privacy concerns in distributed resource allocation over directed networks. It introduces the DP-DGT algorithm to obfuscate exchanged messages using Laplacian noise, ensuring convergence to optimal solutions. The study addresses privacy issues in economic dispatch problems and provides a comprehensive comparison of related decentralized algorithms. The proposed algorithm focuses on privacy guarantees for δ-adjacent distributed resource allocation problems, relaxing bounded gradient assumptions. The convergence analysis demonstrates the algorithm's ability to converge to a neighborhood of the optimal solution, even with non-convex objectives. Numerical simulations validate the effectiveness of the proposed algorithm.
統計
To address this issue, we propose an algorithm called differentially private dual gradient tracking (DP-DGT) for distributed resource allocation, which obfuscates the exchanged messages using independent Laplacian noise.
Our algorithm ensures that the agents’ decisions converge to a neighborhood of the optimal solution almost surely.
We prove that the cumulative differential privacy loss under the proposed algorithm is finite even when the number of iterations goes to infinity.
引用
"We propose a differentially private dual gradient tracking algorithm, abbreviated as DP-DGT, to address privacy issues in DRA over directed networks."
"With the derived sufficient conditions, we prove that the DP-DGT algorithm converges to a neighborhood of the optimal solution."