CAFe: Cost and Age aware Federated Learning
Sahan Liyanaarachchi, Kanchana Thilakarathna, Sennur Ulukus

TL;DR
This paper introduces CAFe, a federated learning framework that optimizes communication and resource efficiency by considering client age and proposing an analytical method to select optimal parameters.
Contribution
It presents a novel approach incorporating client age into convergence analysis and provides an analytical scheme for parameter selection in federated learning.
Findings
Client age explicitly affects convergence bounds.
Optimal parameters M and T can be analytically determined.
Reduced communication cost and resource wastage achieved.
Abstract
In many federated learning (FL) models, a common strategy employed to ensure the progress in the training process, is to wait for at least clients out of the total clients to send back their local gradients based on a reporting deadline , once the parameter server (PS) has broadcasted the global model. If enough clients do not report back within the deadline, the particular round is considered to be a failed round and the training round is restarted from scratch. If enough clients have responded back, the round is deemed successful and the local gradients of all the clients that responded back are used to update the global model. In either case, the clients that failed to report back an update within the deadline would have wasted their computational resources. Having a tighter deadline (small ) and waiting for a larger number of participating clients (large ) leads to…
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 · Technology Use by Older Adults · Context-Aware Activity Recognition Systems
