analiza aiqbench
This research introduces FastFederatedLearning (FFL), a high-performance open-source framework implemented in C/C++ that significantly outperforms existing tools like Intel OpenFL across diverse hardware architectures. By enabling dynamic communication graphs and offering full customizability, the study addresses critical bottlenecks in distributed machine learning infrastructure, moving federated systems toward scalable, long-term service models.
Efficiently Distributed Federated Learning
arXiv:2609.19972v1 Announce Type: cross Abstract: Federated Learning (FL) is experiencing a substantial research interest, with many frameworks being developed to allow practitioners to build federations easily and quickly. Most of these efforts do not consider two main aspects that are key to Machine Learning (ML) software: customizability and performance. This research addresses these issues by implementing an open-source FL framework named FastFederatedLearning (FFL). FFL is implemented in C/C++, focusing on code performance, and allows the user to specify any communication graph between clients and servers involved in the federation, ensuring customizability. FFL is tested against Intel OpenFL, achieving consistent speedups over different computational platforms (x86-64, ARM-v8, RISC-V), ranging from 2.5x and 3.69x. We aim to wrap FFL with a Python interface to ease its use and implement a middleware for different communication backends to be used. We aim to build dynamic federations in which relations between clients and servers are not static, giving life to an environment where federations can be seen as long-time evolving structures and exploited as services.
Abstract:Federated Learning (FL) is experiencing a substantial research interest, with many frameworks being developed to allow practitioners to build federations easily and quickly. Most of these efforts do not consider two main aspects that are key to Machine Learning (ML) software: customizability and performance. This research addresses these issues by implementing an open-source FL framework named FastFederatedLearning (FFL). FFL is implemented in C/C++, focusing on code performance, and allows the user to specify any communication graph between clients and servers involved in the federation, ensuring customizability. FFL is tested against Intel OpenFL, achieving consistent speedups over different computational platforms (x86-64, ARM-v8, RISC-V), ranging from 2.5x and 3.69x. We aim to wrap FFL with a Python interface to ease its use and implement a middleware for different communication backends to be used. We aim to build dynamic federations in which relations between clients and servers are not static, giving life to an environment where federations can be seen as long-time evolving structures and exploited as services.
Performance (cs.PF); Artificial Intelligence (cs.AI); Distributed, Parallel, and Cluster Computing (cs.DC)
arXiv:2609.19972 [cs.PF]
(or arXiv:2609.19972v1 [cs.PF] for this version)
https://doi.org/10.48550/arXiv.2609.19972 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
https://doi.org/10.1007/978-3-031-48803-0_40 Focus to learn more DOI(s) linking to related resources
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 277 cuvinte
Subiecte conexe

News
Quantum Computing Report · 25 iul. 2026

Lattice-Based Cryptography Explained
Quantum Zeitgeist · 15 aug. 2026
Amortizing Federated Adaptation: Hypernetwork Driven LoRA for Personalized Foundation Models
arXiv · 6 iun. 2026
Encryption-Compatible Clustered Federated Learning via Distributed Expectation-Maximization over Metadata
arXiv · 31 iul. 2026