Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Model-free Reinforcement Learning of Semantic Communication by Stochastic Policy Gradient (2305.03571v2)

Published 5 May 2023 in eess.SP, cs.IT, cs.LG, math.IT, and stat.ML

Abstract: Following the recent success of Machine Learning tools in wireless communications, the idea of semantic communication by Weaver from 1949 has gained attention. It breaks with Shannon's classic design paradigm by aiming to transmit the meaning, i.e., semantics, of a message instead of its exact version, allowing for information rate savings. In this work, we apply the Stochastic Policy Gradient (SPG) to design a semantic communication system by reinforcement learning, separating transmitter and receiver, and not requiring a known or differentiable channel model -- a crucial step towards deployment in practice. Further, we derive the use of SPG for both classic and semantic communication from the maximization of the mutual information between received and target variables. Numerical results show that our approach achieves comparable performance to a model-aware approach based on the reparametrization trick, albeit with a decreased convergence rate.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Edgar Beck (8 papers)
  2. Carsten Bockelmann (22 papers)
  3. Armin Dekorsy (43 papers)
Citations (5)

Summary

We haven't generated a summary for this paper yet.