Hidden in Rounds: Predicting the Time Cost of 802.11 Contention in Federated Learning

• URL: http://arxiv.org/abs/2609.12903v1
• Date: Fri, 11 Sep 2026 14:30:26 GMT
• Title: Hidden in Rounds: Predicting the Time Cost of 802.11 Contention in Federated Learning
• Abstract summary: Federated learning over IEEE802.11 shares the wireless channel among clients that send model updates.<n>We use ns-3 to measure the frame-delivery ratio and saturation throughput for different client densities and offered loads.<n>A separate FedAvg trainer uses the frame-delivery ratio as a first-order proxy for the update-admission probability and uses an equation to estimate communication time.
• Score: 2.313256061695585
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Federated learning over IEEE~802.11 shares the wireless channel among clients that send model updates. We use ns-3 to measure the frame-delivery ratio and saturation throughput for different client densities and offered loads. A separate FedAvg trainer uses the frame-delivery ratio as a first-order proxy for the update-admission probability and uses an equation to estimate communication time. The method does not simulate the delivery of a complete model update or measure end-to-end training time. Across 720 evaluated runs with two datasets, two data partitions, six client densities, six offered loads, and five seeds, all runs reached their predefined target accuracy within the round budget. Rounds-to-target changed little with offered load, while communication time-to-target increased by about two orders of magnitude across the client-density range. A Bianchi-anchored estimator produced a mean absolute percentage error from $2.3\%$ to $10.2\%$ on held-out configurations. This error is measured against communication time constructed from the same round-duration equation, not against independently measured completion time. We also compare uniform participation with persistent heterogeneous participation. The study does not detect a statistically distinguishable excluded-class accuracy gap over five seeds, but the confidence intervals are wide. The results apply only to the evaluated configurations and do not provide a general convergence or fairness guarantee.

Related papers

• Accuracy Is Not Service: A Decision-Aware Benchmark for Intermittent-Demand Forecasting [4.1751058176413105]
  We benchmarked 38 forecasting methods spanning classical, intermittent-demand, machine-learning, deep-learning, and pretrained foundation models.<n>Forecast-accuracy rank and order-service rank are negatively correlated on the industrial panel, at -0.555, across methods evaluated on 20,330 real multi-item orders.<n>For intermittent demand, the lowest-error forecast need not deliver the highest service, which can be reduced without retraining.
  arXiv  Detail & Related papers  (2026-09-12T09:51:30Z)
• RynnValue: Scaling Robotic Value Foundation Models with Temporal Distance [84.26294415726723]
  General-purpose reward models are increasingly the bottleneck for scaling robot learning.<n>We introduce RynnValue, an open-source value foundation model for robotic manipulation.<n>RynnValue scales to over 7,000 hours and roughly 3M instruction-conditioned clips without preference or progress annotations.
  arXiv  Detail & Related papers  (2026-08-10T17:09:37Z)
• Selective Test-Time Compute Scaling for Click-Through Rate Prediction via Uncertainty-Triggered Feature Path Exploration [9.542597285477683]
  Scaling test-time compute has proven highly effective for language models, yet this opportunity remains largely unexplored for industrial Click-Through Rate (CTR) prediction.<n>We propose UTTSI (Uncertainty-Triggered Test-Time Selective Inference), a training-free model-agnostic framework that scales inference depth proportionally to per-instance uncertainty.
  arXiv  Detail & Related papers  (2026-05-24T10:29:10Z)
• Ask Early, Ask Late, Ask Right: When Does Clarification Timing Matter for Long-Horizon Agents? [0.7199239000118145]
  We introduce a forced-injection framework that provides ground-truth clarifications at controlled points in the agent's trajectory.<n>We find that the value of clarification depends sharply on what information is missing.<n>A complementary study of 300 unscripted sessions reveals that no current frontier model asks within the empirically optimal window.
  arXiv  Detail & Related papers  (2026-05-08T16:08:03Z)
• Prediction-space knowledge markets for communication-efficient federated learning on multimedia tasks [0.0]
  Federated learning (FL) enables collaborative training over distributed multimedia data.<n>We propose KTA v2, a prediction-space knowledge trading market for FL.<n>Experiments on FEMNIST, CIFAR-10 and AG News show that KTA v2 consistently outperforms a local-only baseline and strong parameter-based methods.
  arXiv  Detail & Related papers  (2025-11-30T11:24:19Z)
• Perfectly-Private Analog Secure Aggregation in Federated Learning [51.61616734974475]
  In federated learning, multiple parties train models locally and share their parameters with a central server, which aggregates them to update a global model.<n>In this paper, a novel secure parameter aggregation method is proposed that employs the torus rather than a finite field.
  arXiv  Detail & Related papers  (2025-09-10T15:22:40Z)
• Distributed Training under Packet Loss [8.613477072763404]
  Leveraging unreliable connections will reduce latency but may sacrifice model accuracy and convergence once packets are dropped.<n>We introduce a principled, end-to-end solution that preserves accuracy and convergence guarantees under genuine packet loss.<n>This work bridges the gap between communication-efficient protocols and the accuracy and guarantees demanded by modern large-model training.
  arXiv  Detail & Related papers  (2025-07-02T11:07:20Z)
• Relational Conformal Prediction for Correlated Time Series [56.59852921638328]
  We address the problem of uncertainty quantification in time series by exploiting correlated sequences.<n>We propose a novel distribution-free approach based on conformal prediction framework and quantile regression.<n>Our approach provides accurate coverage and achieves state-of-the-art uncertainty quantification in relevant benchmarks.
  arXiv  Detail & Related papers  (2025-02-13T16:12:17Z)
• ResFed: Communication Efficient Federated Learning by Transmitting Deep Compressed Residuals [24.13593410107805]
  Federated learning enables cooperative training among massively distributed clients by sharing their learned local model parameters. We introduce a residual-based federated learning framework (ResFed), where residuals rather than model parameters are transmitted in communication networks for training. By employing a common prediction rule, both locally and globally updated models are always fully recoverable in clients and the server.
  arXiv  Detail & Related papers  (2022-12-11T20:34:52Z)
• Predicting with Confidence on Unseen Distributions [90.68414180153897]
  We connect domain adaptation and predictive uncertainty literature to predict model accuracy on challenging unseen distributions. We find that the difference of confidences (DoC) of a classifier's predictions successfully estimates the classifier's performance change over a variety of shifts. We specifically investigate the distinction between synthetic and natural distribution shifts and observe that despite its simplicity DoC consistently outperforms other quantifications of distributional difference.
  arXiv  Detail & Related papers  (2021-07-07T15:50:18Z)
• Data Dependent Randomized Smoothing [127.34833801660233]
  We show that our data dependent framework can be seamlessly incorporated into 3 randomized smoothing approaches. We get 9% and 6% improvement over the certified accuracy of the strongest baseline for a radius of 0.5 on CIFAR10 and ImageNet.
  arXiv  Detail & Related papers  (2020-12-08T10:53:11Z)
• Towards Streaming Perception [70.68520310095155]
  We present an approach that coherently integrates latency and accuracy into a single metric for real-time online perception. The key insight behind this metric is to jointly evaluate the output of the entire perception stack at every time instant. We focus on the illustrative tasks of object detection and instance segmentation in urban video streams, and contribute a novel dataset with high-quality and temporally-dense annotations.
  arXiv  Detail & Related papers  (2020-05-21T01:51:35Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.