Distributionally Robust Cost Minimized Edge Semantic Intelligence in the Sustainable Metaverse
Bibliographic record
Abstract
With the recent development of the Metaverse, people are more connected with each other. Avatars are used to represent the people, to communicate with one another, and they can build the community virtually. In these processes, a massive amount of data is exchanged between the physical and the virtual world. However, the existing communication technologies are insufficient to support the Metaverse, and the energy consumption of the Metaverse is huge. Therefore, semantic communication is one of the emerging communication paradigms to reduce the size of the data transmitted and reduce energy consumption while maintaining its meaning. Virtual service providers (VSPs) who provide services in the Metaverse can purchase semantic data from the nearby edge sensing units by using two subscription plans: reservation and on-demand. However, in practice, the demand of the VSPs is uncertain due to the variability of the Metaverse. To minimize the cost of the network and prevent over- and under-subscription of the resources, we propose a two-phase stochastic semantic resource allocation (SSRA) scheme. In phase one, a double dutch auction performs a one-to-one matching between VSPs and edge sensing units. The matching is dynamic and depends on the quality of experience (QoE) from the Metaverse users and the semantic data transmission cost from the edge sensing units. The matching changes whenever QoE and the semantic data transmission cost vary. In phase two, we consider the demand uncertainty and matching result from the phase one to formulate a distributed robust optimization (DRO) problem to minimize the operation cost of the VSPs. Using a real-world dataset, simulation results demonstrate that our proposed scheme is fully dynamic and minimizes the operation cost/energy consumption of VSPs in the presence of stochastic uncertainties.
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 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.003 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".