Adaptive Aggregation For Federated Learning
K. R. Jayaram, Vinod Muthusamy, Gegi Thomas, Ashish Verma, Mark, Purcell

TL;DR
This paper introduces AdaFed, a scalable, resource-efficient, and fault-tolerant architecture for federated learning aggregation using serverless functions, capable of handling thousands of participants with significant cost savings.
Contribution
The paper proposes AdaFed, a novel adaptive aggregation system for federated learning that leverages serverless architecture and tree overlay techniques for improved scalability and resource efficiency.
Findings
AdaFed scales to thousands of participants.
Achieves over 90% reduction in resource use and cost.
Maintains low aggregation latency.
Abstract
Advances in federated learning (FL) algorithms,along with technologies like differential privacy and homomorphic encryption, have led to FL being increasingly adopted and used in many application domains. This increasing adoption has led to rapid growth in the number, size (number of participants/parties) and diversity (intermittent vs. active parties) of FL jobs. Many existing FL systems, based on centralized (often single) model aggregators are unable to scale to handle large FL jobs and adapt to parties' behavior. In this paper, we present a new scalable and adaptive architecture for FL aggregation. First, we demonstrate how traditional tree overlay based aggregation techniques (from P2P, publish-subscribe and stream processing research) can help FL aggregation scale, but are ineffective from a resource utilization and cost standpoint. Next, we present the design and implementation…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data · Caching and Content Delivery · Recommender Systems and Techniques
