Deep Reinforcement Learning for Reducing Latency in Mission Critical Services
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Next-generation wireless networks will be supporting mission critical services such as safety related applications of connected autonomous vehicles, and real-time control of medical and industrial systems, as well as serving traditional mobile users. In mission critical services, high-reliability and low-latency requirements should be satisfied. In this paper, we aim to reduce the latency of uplink scheduling of a network of Mission Critical Devices (MCDs) while maintaining fairness among other users, served by a dense small cell network. We propose a Deep Reinforcement Learning algorithm, namely Delay Minimizing Deep Q-Learning (DMDQ), that combines Long Short-term Memory with Q-learning. The problem is cast as a resource block allocation for delay minimization. The proposed algorithm is compared to a tabular Q-learning approach and a simple Round Robin (RR) algorithm in terms of latency, throughput, fairness and convergence. Our performance results show that DMDQ outperforms both schemes in terms of latency and offers high fairness. The Q-learning approach achieves slightly higher throughput than DMDQ however DMDQ convergences faster.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it