Decentralized Differentially Private Power Method
Andrew Campbell, Anna Scaglione, and Sean Peisert

TL;DR
This paper introduces a decentralized algorithm for private PCA that ensures differential privacy without a central server, working effectively even when each agent observes only part of the data.
Contribution
It develops a novel decentralized differentially private power method for PCA in multi-agent networks with partial data access, providing theoretical privacy and convergence guarantees.
Findings
Achieves $(\epsilon,\delta)$-DP with proven guarantees.
Outperforms naive local DP methods in utility.
Converges rapidly, balancing privacy and utility.
Abstract
We propose a novel Decentralized Differentially Private Power Method (D-DP-PM) for performing Principal Component Analysis (PCA) in networked multi-agent settings. Unlike conventional decentralized PCA approaches where each agent accesses the full n-dimensional sample space, we address the challenging scenario where each agent observes only a subset of dimensions through row-wise data partitioning. Our method ensures -Differential Privacy (DP) while enabling collaborative estimation of global eigenvectors across the network without requiring a central aggregator. We achieve this by having agents share only local embeddings of the current eigenvector iterate, leveraging both the inherent privacy from random initialization and carefully calibrated Gaussian noise additions. We prove that our algorithm satisfies the prescribed -DP guarantee and…
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.
