mlsanityData to 14 Oct 2026

Differentially private and decentralized randomized power method

arXiv 2411.01931 ↗First posted 4 Nov 2024cs.LG cs.CR cs.NAcited by 6

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

  1. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,139
  2. 2020Inverting Gradients -- How easy is it to break privacy in federated learning?cited by 712
  3. 2019Neural Graph Collaborative Filteringcited by 661
  4. 2016Concentrated Differential Privacy: Simplifications, Extensions, and Lower Boundscited by 346
  5. 2014Sketching as a Tool for Numerical Linear Algebracited by 288
  6. 2021The Distributed Discrete Gaussian Mechanism for Federated Learning with Secure Aggregationcited by 128
  7. 2020FastSecAgg: Scalable Secure Aggregation for Privacy-Preserving Federated Learningcited by 61
  8. 2013The Noisy Power Method: A Meta Algorithm with Applicationscited by 58
  9. 2021How Powerful is Graph Convolution for Recommendation?cited by 50
  10. 2022Blurring-Sharpening Process Models for Collaborative Filteringcited by 35
  11. 2016An Improved Gap-Dependency Analysis of the Noisy Power Methodcited by 24
  12. 2022DP-PCA: Statistically Optimal and Differentially Private PCAcited by 24
5 more
  1. 2013Memory Limited, Streaming PCAcited by 21
  2. 2019Scalable and Differentially Private Distributed Aggregation in the Shuffled Modelcited by 20
  3. 2020An Accurate, Scalable and Verifiable Protocol for Federated Differentially Private Averagingcited by 20
  4. 2024The Privacy Power of Correlated Noise in Decentralized Learningcited by 18
  5. 2021FedPower: Privacy-Preserving Distributed Eigenspace Estimationcited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 4; 2026: 1.

6 papers.