arXiv Machine Learning By Xiaobo Zhao, Daniel E. Lucani

MUFFLe: Efficient Model Update Compression via Generalized Deduplication for Federated Learning

Read the original on arXiv Machine Learning →

arXiv:2606. 14354v1 Announce Type: new Abstract: Federated learning is well suited to edge environments but is often limited by the uplink cost of transmitting model updates.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Sep 11

MUC-FL: Block-Wise Marginal Utility Contribution for Communication-Efficient Federated Learning

The paper introduces MUC-FL, a block‑wise marginal utility contribution framework that selectively transmits only the most impactful data blocks in federated learning to reduce communication overhead. Applied to a multimodal dataset derived from multiple MIMIC clinical datasets, the method identifies 24 out of 1,135 candidate blocks (1.76%) as carrying meaningful improvement signals, potentially cutting communication by 45‑50% while preserving or enhancing model quality. The deduplication‑based block selection achieves a macro F1 score of 0.8566 versus 0.8155 for standard federated optimization, showing improved performance especially for underrepresented classes.

By Akshay Mhatre, Vikram Karthick, Deepti Gupta, Jia Zou
arXiv Machine Learning
1d ago

FedSAP: Federated Learning with Structured Adaptive Partitioning for Multi-Domain Heterogeneous Edge Devices

FedSAP is a federated learning framework that addresses heterogeneous edge devices by using structured pruning as a budget-constrained tri-state channel allocation. It partitions model channels into a Global pool, pseudo-domain-specific Private pools, and a Dropped state, allowing broadly useful features to be shared while isolating domain-sensitive updates. Experiments on Digits and Office-Caltech datasets show FedSAP achieving higher mean global accuracy than the strongest baseline while supporting up to 80% client pruning ratios.

By Wentao Yue, Tianyou Lai, Hongji Li, Qingyu Mao, Qilei Li
arXiv Machine Learning
1d ago

Latent Information Sharing for Accelerating Federated Learning

The paper introduces a latent information sharing scheme for federated learning that mitigates client drift by sharing a small amount of hidden‑layer activations. The authors demonstrate both theoretically and empirically that this approach improves training efficiency while maintaining convergence guarantees and data privacy. Compared to existing methods such as FedProx, SCAFFOLD, FedPVR, FedProto, and SplitFed, the proposed method achieves higher model accuracy within a fixed round budget without adding significant communication overhead.

By Seungjun Lee, Ensieh Khazaei, Dimitrios Hatzinakos, Baturalp Buyukates, Sunwoo Lee
arXiv AI
Sep 18

Accelerating Sharded Data Parallelism at Scale with Federated Learning

The paper proposes two hybrid algorithms, FL+FSDP and FL+HSDP, that combine sharded data parallelism with federated learning-style aggregations to reduce communication overhead in large-scale AI training. By partitioning GPUs into loosely‑coupled federation groups, the methods keep inter‑group traffic minimal while maintaining a bounded global batch size. Experiments on a Llama3.1 8B model trained on 512 A100 GPUs show up to 8.04× faster data processing and 4.48 lower evaluation perplexity compared to conventional sharded DP.

By Gianluca Mittone, Marco Aldinucci