A Dual-Objective Bandit-Based Opportunistic Band Selection Strategy for Hybrid-Band V2X Metaverse Content Update
Bibliographic record
Abstract
As vehicular communication networks embrace metaverse beyond 5G/6G systems, the rich content update via the least interfered subchannel of the optimal frequency band in a hybrid band vehicle to everything (V2X) setting emerges as a challenging optimization problem. We model this problem as a tradeoff between multi-band VR/AR devices attempting to perform metaverse scenes and environmental updates to metaverse roadside units (MRSUs) while minimizing energy consumption. Due to the computational hardness of this optimization, we formulate an opportunistic band selection problem using a multi-armed bandit (MAB) that provides a good quality solution in real-time without computationally burdening the already stretched augmented/virtual reality (AR/VR) units acting as transmitting nodes. The opportunistic use of scheduling rich content updates at traffic signals and stand-still scenarios maps well with the formulated bandit problem. We propose a Dual-Objective Minimax Optimal Stochastic Strategy (DOMOSS) as a natural solution to this problem. Through extensive computer-based simulations, we demonstrate the effectiveness of our proposal in contrast to baselines and comparable solutions. We also verify the quality of our solution and the convergence of the proposed strategy.
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".