mlsanityData to 14 Oct 2026

Federated singular value decomposition for high dimensional data

arXiv 2205.12109 ↗First posted 24 May 2022cs.LG cs.DScited by 2

Not on the map. Why?

Abstract (arXiv)

Federated learning (FL) is emerging as a privacy-aware alternative to classical cloud-based machine learning. In FL, the sensitive data remains in data silos and only aggregated parameters are exchanged. Hospitals and research institutions which are not willing to share their data can join a federated study without breaching confidentiality. In addition to the extreme sensitivity of biomedical data, the high dimensionality poses a challenge in the context of federated genome-wide association studies (GWAS). In this article, we present a federated singular value decomposition (SVD) algorithm, suitable for the privacy-related and computational requirements of GWAS. Notably, the algorithm has a transmission cost independent of the number of samples and is only weakly dependent on the number of features, because the singular vectors associated with the samples are never exchanged and the vectors associated with the features only for a fixed number of iterations. Although motivated by GWAS, the algorithm is generically applicable for both horizontally and vertically partitioned data.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 13 of its 65 references that are in the map. First posted on arXiv 24 May 2022.

Builds on

13 of 65 references.

References · 13

  1. 2019Advances and Open Problems in Federated Learningcited by 3,046
  2. 2018A generic framework for privacy preserving deep learningcited by 103
  3. 2015Randomized Block Krylov Methods for Stronger and Faster Approximate Singular Value Decompositioncited by 64
  4. 2013The Noisy Power Method: A Meta Algorithm with Applicationscited by 58
  5. 2016An Improved Gap-Dependency Analysis of the Noisy Power Methodcited by 24
  6. 2021Practical Lossless Federated Singular Vector Decomposition over Billion-Scale Datacited by 18
  7. 2014Improved Distributed Principal Component Analysiscited by 14
  8. 2020Communication-Efficient Distributed SVD via Local Power Iterationscited by 12
  9. 2017Smooth Sensitivity Based Approach for Differentially Private Principal Component Analysiscited by 3
  10. 2019Distributed Differentially Private Computation of Functions with Correlated Noisecited by 3
  11. 2020Distributed Estimation for Principal Component Analysis: an Enlarged Eigenspace Analysiscited by 3
  12. 2021The FeatureCloud AI Store for Federated Learning in Biomedicine and Beyondcited by 3
1 more
  1. 2020Privacy Preserving PCA for Multiparty Modelingcited by 1

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 0; 2024: 1.

2 papers.