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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

OracleFed: Latency-Aware Federated Learning via Dynamic Recovery and Causal Aggregation

Baran Can Gül, Nasser Jazdi, Stefanos Tziampazis, Michael Weyrich
IEEE Access
Privacy-Preserving Technologies in Data
article

OracleFed: Latency-Aware Federated Learning via Dynamic Recovery and Causal Aggregation

Baran Can Gül, Nasser Jazdi, Stefanos Tziampazis, Michael Weyrich
article en

Abstract

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.

IEEE AccessVol. 13
University of Stuttgart (DE)
Openalex Percentile: Top 83%
Privacy-Preserving Technologies in Data
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.