Skip to article frontmatterSkip to article content
Site not loading correctly?

This may be due to an incorrect BASE_URL configuration. See the MyST Documentation for reference.

An open-source Python framework for federated learning: you train one model across several sites while patient data stays where it is.

Websitehttps://flower.ai
Source codehttps://github.com/flwrlabs/flower
Developed byFlower Labs, University of Oxford (origin) (2020)
TypeSoftware library: Python package
Lifecycle phaseDevelopment
FUTURE-AIUniversality, Robustness
ForAI developers, Researchers
FacilitationNo facilitator needed
Skills neededPython, a machine learning framework such as PyTorch
CostFree
LanguagesEnglish
MaturityEstablished
LicenceApache-2.0

What it is

With Flower you write a client app that trains on local data and a server app that combines the model updates, using a built-in strategy such as federated averaging or one you write yourself. It works with common machine learning libraries, including PyTorch, TensorFlow, scikit-learn, XGBoost and the medical imaging library MONAI. You can simulate a federation on one machine first and then deploy it across real sites. It also offers add-ons for differential privacy and secure aggregation, which reduce what the server can learn from a single site’s updates. Flower started as a research project at the University of Oxford and is now maintained by Flower Labs with an open community.

In healthcare

Federated learning suits multi-hospital projects where data-sharing agreements or the GDPR prevent pooling patient records. Note that federated training alone does not make a model private: model updates can still leak information, so combine it with differential privacy or secure aggregation and a security review.

Where to use it in The ELSA Way

References

References
  1. Beutel, D. J., Topal, T., Mathur, A., Qiu, X., Fernandez-Marques, J., Gao, Y., Sani, L., Li, K. H., Parcollet, T., de Gusmão, P. P. B., & Lane, N. D. (2020). Flower: A Friendly Federated Learning Research Framework. arXiv. 10.48550/ARXIV.2007.14390