Differentially private and decentralized randomized power method
Not on the map. Why?
Abstract (arXiv)
The randomized power method has gained significant interest due to its simplicity and efficient handling of large-scale spectral analysis and recommendation tasks. However, its application to large datasets containing personal information (e.g., web interactions, search history, personal tastes) raises critical privacy problems. This paper addresses these issues by proposing enhanced privacy-preserving variants of the method. First, we propose a variant that reduces the amount of the noise required in current techniques to achieve Differential Privacy (DP). More precisely, we refine the privacy analysis so that the Gaussian noise variance no longer grows linearly with the target rank, achieving the same DP guarantees with strictly less noise. Second, we adapt our method to a decentralized framework in which data is distributed among multiple users. The decentralized protocol strengthens privacy guarantees with no accuracy penalty and a low computational and communication overhead. Our results include the provision of tighter convergence bounds for both the centralized and decentralized versions, and an empirical comparison with previous work using real recommendation datasets.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 17 of its 45 references that are in the map. First posted on arXiv 4 Nov 2024.
Builds on
17 of 45 references.
References · 17
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,139
- 2020Inverting Gradients -- How easy is it to break privacy in federated learning?cited by 712
- 2019Neural Graph Collaborative Filteringcited by 661
- 2016Concentrated Differential Privacy: Simplifications, Extensions, and Lower Boundscited by 346
- 2014Sketching as a Tool for Numerical Linear Algebracited by 288
- 2021The Distributed Discrete Gaussian Mechanism for Federated Learning with Secure Aggregationcited by 128
- 2020FastSecAgg: Scalable Secure Aggregation for Privacy-Preserving Federated Learningcited by 61
- 2013The Noisy Power Method: A Meta Algorithm with Applicationscited by 58
- 2021How Powerful is Graph Convolution for Recommendation?cited by 50
- 2022Blurring-Sharpening Process Models for Collaborative Filteringcited by 35
- 2016An Improved Gap-Dependency Analysis of the Noisy Power Methodcited by 24
- 2022DP-PCA: Statistically Optimal and Differentially Private PCAcited by 24
5 more
- 2013Memory Limited, Streaming PCAcited by 21
- 2019Scalable and Differentially Private Distributed Aggregation in the Shuffled Modelcited by 20
- 2020An Accurate, Scalable and Verifiable Protocol for Federated Differentially Private Averagingcited by 20
- 2024The Privacy Power of Correlated Noise in Decentralized Learningcited by 18
- 2021FedPower: Privacy-Preserving Distributed Eigenspace Estimationcited by 4
Built on by
Citing papers per year: 2024: 1; 2025: 4; 2026: 1.
6 papers.
- 2025An Iterative Algorithm for Differentially Private k-PCA with Adaptive Noisecited by 3
- 2025Differential Privacy Analysis of Decentralized Gossip Averaging under Varying Threat Modelscited by 2
- 2024Exposing the Vulnerability of Decentralized Learning to Membership Inference Attacks Through the Lens of Graph Mixingcited by 1
- 2025Decentralized Differentially Private Power Methodcited by 1
- 2026Adaptive Power Iteration Method for Differentially Private PCAcited by 1
- 2025Dropout-Robust Mechanisms for Differentially Private and Fully Decentralized Mean Estimationcited by 0
- 2026Adaptive Power Iteration Method for Differentially Private PCA12 Feb 2026
- 2025An Iterative Algorithm for Differentially Private k-PCA with Adaptive Noise14 Aug 2025
- 2025Decentralized Differentially Private Power Method30 Jul 2025
- 2025Dropout-Robust Mechanisms for Differentially Private and Fully Decentralized Mean Estimation4 Jun 2025
- 2025Differential Privacy Analysis of Decentralized Gossip Averaging under Varying Threat Models26 May 2025
- 2024Exposing the Vulnerability of Decentralized Learning to Membership Inference Attacks Through the Lens of Graph Mixing17 Dec 2024