OracleFed: Latency-Aware Federated Learning via Dynamic Recovery and Causal Aggregation
As federated learning (FL) continues to expand across wide-area, heterogeneous networks, preserving true training chronology grows complex, particularly in time-sensitive applications where network delays can obscure causal ordering and degrade global-model fidelity. Current aggregation schemes seldom account for temporal dynamics: they either stall on stragglers, discard late updates, or rely on arrival-based heuristics that conflate communication latency with training staleness. In light of this limitation, we introduce <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">OracleFed—Order-Respecting Aggregation with Causality and Latency Equalization</i>, a framework in which training-time lag is decoupled from network-transport delay and elevated as the primary driver of aggregation. Leveraging a hybrid design that integrates dual timestamping with system-wide synchronization, the framework continuously recalibrates the server’s waiting window and re-indexes arrivals by their generation timestamps, thereby preserving causal order. Rather than treating late arrivals as inherently stale, <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">OracleFed</i> discounts only genuine training staleness, allowing high-latency clients to contribute proportionally to their computational freshness. We benchmark the proposed framework against existing synchronous and asynchronous schemes across eight evaluation metrics in a distributed, in-vehicle emotion-recognition setting. Paired <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t</i>- andWilcoxon signed-rank analyses of twenty Monte-Carlo replicates verify that <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">OracleFed</i> combines the coordination advantages of both paradigms and achieves higher predictive quality, lower staleness, and fairer client participation than the baselines.
Authors
- Baran Can Gül (ORCID: https://orcid.org/0000-0002-5626-7551)
- Nasser Jazdi (ORCID: https://orcid.org/0000-0001-6722-0911)
- Stefanos Tziampazis (ORCID: https://orcid.org/0000-0003-2078-9849)
- Michael Weyrich (ORCID: https://orcid.org/0000-0003-3176-9288)
Institutions
- University of Stuttgart (DE)
Publication Details
- Journal
- IEEE Access
- Published
- 2025-01-01
- DOI
- https://doi.org/10.1109/access.2025.3627490
- Primary Topic
- Privacy-Preserving Technologies in Data
- Type
- article
- Field-Weighted Citation Impact
- 0.00