Generative AI-Driven Incentive Mechanism for Semantic Communications in RSMA Networks
Bibliographic record
Abstract
This paper proposes a framework integrating Rate Splitting Multiple Access (RSMA), semantic communications, and generative AI for optimizing next-generation wireless networks. We present a unified model that combines RSMA with semantic communications to enhance both spectral efficiency and semantic fidelity. Our system model focuses on a downlink semantic communication system with a multi-antenna base station serving multiple single-antenna users. A dynamic contract-based incentive mechanism is developed to address user heterogeneity and information asymmetry in semantic RSMA scenarios. We introduce a diffusion model-based approach for joint optimization of resource allocation and contract design in RSMA systems. The semantic encoding process extracts key information, i.e., free-space detection, interest points, object attributes, and spatial relationships, from image data. A loss function is designed to train the semantic encoder and RSMA scheme, incorporating semantic extraction, partitioning, reconstruction, and task-specific components. Our framework includes a multi-objective performance evaluation that considers both conventional metrics and semantic accuracy in a multi-user RSMA environment. We also define a multi-component semantic accuracy metric to assess the quality and utility of the extracted semantic information. Extensive simulation results demonstrate the superiority of our proposed framework over existing approaches in terms of system throughput, energy efficiency, and semantic fidelity across various network scenarios and user distributions.
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.004 | 0.008 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.002 | 0.004 |
| Open science | 0.003 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| 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".