Utility Optimization for Resource Allocation in Multi-Access Edge Network Slicing: A Twin-Actor Deep Deterministic Policy Gradient Approach
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
To achieve the service-oriented features of the 5G, network slicing aims to create logical virtual networks where multiple services are provided on a common physical infrastructure. The performance of network slicing depends on the intelligent management of multi-dimensional resources, which are exactly what multi-access edge computing (MEC) provides. This paper proposes joint optimization of communication, computing and caching (3C) resources in multi-access edge network slicing. The optimization objective of the two-level resource allocation problem is to maximize the utility obtained by mobile virtual network operators while ensuring the quality of service (QoS). The deep reinforcement learning (DRL) approach is employed which enables the resource allocation scheme to intelligently adapt to the dynamic environment. Specifically, we propose a novel DRL approach named twin-actor deep deterministic policy gradient (twin-actor DDPG). Since the action space is continuous, the DDPG is adopted where the actor generates the deterministic policy while the critic evaluates the policy and guides the actor to obtain the optimal policy. A novel twin-actor structure is put forward to replace the actor of the DDPG, thus the slice-level action and user-level action can be generated respectively. The convergence and effectiveness of the proposed DRL based algorithm is are verified by numerical simulation.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.002 |
| Science and technology studies | 0.002 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.003 | 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