Caching for Doubly Selective Fading Channels via Model-Agnostic Meta-Reinforcement Learning
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
Edge caching is expected to alleviate the traffic consumption in next-generation communications. In this article, we consider the transmission delay in wideband communications deteriorated by rapid user movements, where the frequency-selective wideband fading channels become fast time-varying and hence <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">doubly-selective</i> due to the user movements. To preferably allocate the caching resource in such circumstance, we introduce a coordinated caching network and accordingly formulate an allocation problem. However, the formulated problem is shown to be NP-hard. By considering the extremely high computational complexity to solve the NP-hard problem by traditional optimization algorithm, and considering only a few samples can be obtained for each training instance due to shortened coherence-time in the dynamical doubly selective fading channels, we propose a model-agnostic meta-reinforcement learning method to address the formulated problem. Particularly, the proposed method can efficiently recognize the unstable mobile channels and accordingly cache to reduce the overall transmission delay while only requires a few training samples. Numerical simulations are performed to verify the effectiveness of the proposed method and results show that the proposed one outperforms the commonly adopted existing method of deep-deterministic-policy-gradient learning in terms of average delay and cache hit rate.
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.
Direct model labels (unvalidated)
Per-model category and study-design labels from the labeling rounds. They are machine output, unvalidated, and the disagreement between models ships as data. No study design here is MEDLINE-validated yet.
| Model arm | Categories | Study design | Confidence |
|---|---|---|---|
| gemma | no category Domain: not available · Genre: Empirical About the Canadian research system: no · About a Canadian topic: no | Simulation or modeling | low |
| gpt | no category Domain: not available · Genre: Methods About the Canadian research system: no · About a Canadian topic: no | Simulation or modeling | high |
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.002 | 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.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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