Adaptive offloading in multi-access edge networks via hierarchical federated learning and real-time system adaptation
Bibliographic record
Abstract
Achieving ultra-reliable real-time digital twin (DT) adaptation in mobile edge environments requires intelligent orchestration of computation and communication under user heterogeneity and dynamic mobility. This paper introduces GADENet, a graph attention-enhanced digital twin evolution network that fuses graph neural modelling, multi-agent actor-critic learning, and hierarchical federated personalisation to enable seamless digital representations of user equipment (UE) in distributed edge networks. At its core, GADENet employs a GAT-assisted multi-agent deep deterministic policy gradient (MADDPG) framework to jointly learn optimal DT migration and personalisation strategies across edge servers, guided by real-time traffic topologies and resource interdependencies. Each DT model is modularised into generalisable and adaptive subspaces, trained collaboratively through a three-tier edge-cloud federated loop and refined using localised attention-based updates. For efficient mobility handling, we propose a parameter-sliced DT relay protocol that selectively migrates the minimal personalisation subset across servers, leveraging learned action-value functions to minimise response latency. Extensive simulations on CIFAR-based datasets and synthetic edge workloads demonstrate that GADENet achieves up to 30% reduction in interaction latency and significantly boosts modelling fidelity versus strong federated and DRL-based baselines. This work offers a principled blueprint for intelligent DT deployment under the constraints of 6G and next-gen IoT fabrics.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".