.png){kind=icon}
Return
A hybrid federated kernel regularized least squares algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2024.112600.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Federated learning is becoming an increasingly viable and accepted strategy for building machine learning models in critical privacy-preserving scenarios such as clinical settings. Often, the data involved is not limited to clinical data but also includes additional omics features (e.g. proteomics). Consequently, data is distributed not only across hospitals but also across omics centers, which are labs capable of generating such additional features from biosamples. This scenario leads to a hybrid setting where data is scattered both in terms of samples and features. In this setting, we present a novel efficient federated reformulation of the Kernel Regularized Least Squares algorithm which leverages a randomized version of the Nystr & ouml;m method, introduce two variants for the optimization process and validate them using well-established datasets. In principle, the presented core ideas could be applied to any other kernel method to make it federated. Lastly, we discuss security measures to defend against possible attacks.
Keywords:
Hybrid federated learning
Random kernel methods
Regularized Least Squares
Privacy-preserving machine learning
Journal
K
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
View more