Skip to content
aiqbench takeMachine Learning

aiqbench analysis

This paper addresses critical bottlenecks in federated learning by proposing a joint selection algorithm for clients and training data to accelerate convergence under non-iid conditions. The approach specifically targets scenarios with straggling clients and limited participant numbers, demonstrating improved accuracy over probabilistic methods on the CIFAR-100 dataset. By optimizing participation rates and handling data heterogeneity, this work offers a practical advancement for deploying privacy-preserving machine learning in resource-constrained environments.
Sources coveringarXiv, Hugging Face
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Client and Training Data Selection for Computationally Efficient Synchronized Federated Learning

arXiv2 min read

arXiv:2609.39250v1 Announce Type: new Abstract: Federated learning (FL) is a promising paradigm of machine learning, which preserves user privacy by enabling learning without sharing raw data with a cloud server. Straggling clients have been a problem for FL as they introduce delays in aggregating the local models and hence, the convergence of the global model. Therefore, it is important to have a mechanism that ensures fast convergence of the global model as well as good FL participation rate. Another issue for the convergence of a model in FL is the non-independent and identically distributed (non-iid) data across the clients. Prior approaches based on probabilistic client selection do not work well under non-iid data especially when the number of clients is small. We show scenarios where such approaches fail and propose a joint client-training data selection algorithm for fast convergence of FL models. Our experiments on CIFAR-100 dataset show that convergence of the FL model can be significantly improved over prior works that can consider non-iid data and heterogeneous computation and higher model accuracy.

Abstract:Federated learning (FL) is a promising paradigm of machine learning, which preserves user privacy by enabling learning without sharing raw data with a cloud server. Straggling clients have been a problem for FL as they introduce delays in aggregating the local models and hence, the convergence of the global model. Therefore, it is important to have a mechanism that ensures fast convergence of the global model as well as good FL participation rate. Another issue for the convergence of a model in FL is the non-independent and identically distributed (non-iid) data across the clients. Prior approaches based on probabilistic client selection do not work well under non-iid data especially when the number of clients is small. We show scenarios where such approaches fail and propose a joint client-training data selection algorithm for fast convergence of FL models. Our experiments on CIFAR-100 dataset show that convergence of the FL model can be significantly improved over prior works that can consider non-iid data and heterogeneous computation and higher model accuracy.

Machine Learning (cs.LG); Distributed, Parallel, and Cluster Computing (cs.DC)

arXiv:2609.39250 [cs.LG]

(or arXiv:2609.39250v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2609.39250 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

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.

Full text under the publisher's open licence · 268 words

Related coverage