In this paper, a semantic communication framework is proposed for textual data transmission. In the studied model, a base station (BS) extracts the semantic information from textual data, and transmits it to each user. The semantic information is modeled by a knowledge graph (KG) that consists of a set of semantic triples. After receiving the semantic information, each user recovers the original text using a graph-to-text generation model. To measure the performance of the considered semantic communication framework, a metric of semantic similarity (MSS) that jointly captures the semantic accuracy and completeness of the recovered text is proposed. Due to wireless resource limitations, the BS may not be able to transmit the entire semantic information to each user and satisfy the transmission delay constraint. Hence, the BS must select an appropriate resource block for each user as well as determine and transmit part of the semantic information to the users. As such, we formulate an optimization problem whose goal is to maximize the total MSS by jointly optimizing the resource allocation policy and determining the partial semantic information to be transmitted. To solve this problem, a proximal-policy-optimization-based reinforcement learning (RL) algorithm integrated with an attention network is proposed. The proposed algorithm can evaluate the importance of each triple in the semantic information using an attention network and then, build a relationship between the importance distribution of the triples in the semantic information and the total MSS. Compared to traditional RL algorithms, the proposed algorithm can dynamically adjust its learning rate thus ensuring convergence to a locally optimal solution.
翻译:在本文中, 为文本数据传输建议了一个语义通信框架 。 在所研究的模型中, 一个基站( BS) 从文本数据中提取语义信息, 并将其传送给每个用户。 语义信息由一套语义三重组成的知识图形( KG) 建模。 因此, BS 必须为每个用户选择一个合适的资源块, 并使用一个图形- 文本生成模型来决定和向用户传输部分语义信息。 因此, 我们提出一个优化问题, 目标是通过共同优化资源分配政策和确定所回收文本的语义完整。 由于无线资源限制, BS 可能无法将全部语义信息传输给每个用户, 并满足传输延迟限制。 因此, BS 必须为每个用户选择一个合适的资源块, 并使用一个图形- 语义生成模型生成信息的一部分。 因此, 我们提出一个优化问题, 目标是通过共同优化资源分配政策, 确定所回收的语义性总体信息的语义整合度, 并且确定所恢复的语义和语义的语义性关系。 因此, 将每个基于语言流流流流流流流流流流流流的流的流流路路路路路路路路路段段段进行学习一个学习一个高级学习一个学习。