Federated singular value decomposition for high-dimensional data

Hartebrodt A, Röttger R, Blumenthal DB (2024)

Publication Type: Journal article

Publication year: 2024


Book Volume: 38

Pages Range: 938 - 975

DOI: 10.1007/s10618-023-00983-z


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 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 corresponding to the samples are never exchanged and the vectors associated with the features are only transmitted to an aggregator for a fixed number of iterations. Although motivated by GWAS, the algorithm is generically applicable for both horizontally and vertically partitioned data.

Authors with CRIS profile

Involved external institutions

How to cite


Hartebrodt, A., Röttger, R., & Blumenthal, D.B. (2024). Federated singular value decomposition for high-dimensional data. Data Mining and Knowledge Discovery, 38, 938 - 975. https://doi.org/10.1007/s10618-023-00983-z


Hartebrodt, Anne, Richard Röttger, and David B. Blumenthal. "Federated singular value decomposition for high-dimensional data." Data Mining and Knowledge Discovery 38 (2024): 938 - 975.

BibTeX: Download