Serve Yourself! Federated Power Control for AI-Native 5G and Beyond
Bibliographic record
Abstract
The adoption of the Industrial Internet of Things (IIoT) in industries necessitates advancements in energy efficiency and latency reduction, especially for resource-constrained devices. Services require specific Quality of Service (QoS) levels to function properly, and meeting a threshold QoS can be sufficient for smooth connectivity, reducing the need to maximize perceived QoS due to energy concerns. This is modeled as a satisfactory game, aiming to find minimal power allocation to meet target demands. Due to environmental uncertainties, achieving a Robust Satisfactory Equilibrium (RSE) can be challenging, leading to less satisfaction. We propose a fully distributed, environment-aware power control scheme to enhance satisfaction in dynamic environments. The proposed Robust Banach-Picard (RBP) learning scheme combines deep learning and federated learning to overcome channel and interference impacts and accelerate convergence. Extensive simulations evaluate the scheme under varying channel states and QoS demands, with discussions on convergence speed, energy efficiency, scalability, complexity, and violation 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.
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.000 | 0.001 |
| 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.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.026 | 0.007 |
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".