Hidden in Rounds: Predicting the Time Cost of 802.11 Contention in Federated Learning
Read the original on arXiv Machine Learning →The paper investigates how the time cost of 802.11 contention affects federated learning. Using ns-3 simulations, the authors measure frame-delivery ratios and saturation throughput across various client densities and offered loads, then employ a FedAvg trainer that uses these ratios to estimate communication time. Across 720 runs with diverse datasets, partitions, densities, loads, and seeds, all models reached target accuracy within the round budget, with communication time-to-target increasing significantly as client density rose. The study also compares uniform and persistent heterogeneous participation, finding no statistically significant accuracy gap, though confidence intervals are wide. The results are specific to the evaluated configurations and do not generalize to all convergence or fairness scenarios.
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.