A Novel Robust Reinforcement Learning-based Dependent Task Offloading Algorithm for Mobile Edge Intelligence
Bibliographic record
Abstract
With the rise of advanced applications based on Artificial Intelligence (AI) and Internet-of-Things (IoT), mobile devices have become more intelligent, introducing a novel concept, Mobile Edge Intelligence. But the limited on-board resources often hinder the capabilities of mobile devices. Mobile Edge Computing (MEC), regarded as an effective method to expand device capability, effectively overcomes this barrier. However, the dynamic networks driven by mobility and the dependency on applications pose significant challenges for offloading, which can degrade MEC’s overall performance. Therefore, how to effectively combine the above points to achieve a stable and effective sharing of computing resources between devices and servers is a critical issue. In this paper, we consider a multi-slot MEC system with device mobility and multiple applications of unknown arrival. To improve application completion rate while reducing task delay, we introduce a novel, robust distributed offloading algorithm, which calls the Multi-Attention Pointer network-based Reinforcement Learning algorithm (MAPRL), for the dynamic and unstable resource offloading scenario. Numerous experiments have been carried out to demonstrate that, compared with the existing methods, MAPRL exhibits robustness when facing the changing scenario, it can adapt to the unknown workload and dynamic network connections to enhance the offloading performance.
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.002 | 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".