Robust Deep Joint Source Channel Coding for Task-Oriented Semantic Communications
Taewoo Park, Eunhye Hong, Yo-Seb Jeon, Namyoon Lee, Yongjune Kim
TL;DR
The paper tackles robustness in task-oriented semantic communications by addressing channel-induced stochasticity in deep JSCC. It introduces a KL-divergence based regularizer that makes the noisy posterior approximate the noise-free posterior, and derives a tractable form $\mathcal{R} = \frac{\sigma^2}{2} \mathrm{Tr}(I(z))$ via a Fisher information based Taylor expansion. This regularizer smooths the log-posterior curvature and adapts to channel conditions, all while being architecture-agnostic and not increasing inference complexity. Empirical results across analog and digital JSCC setups (under AWGN and fading channels) show consistent improvements in task accuracy, especially when training and testing channel conditions differ. The approach offers a practical boost to reliable, task-oriented semantic communications with potential broad applicability to posterior-dependent systems.
Abstract
Semantic communications based on deep joint source-channel coding (JSCC) aim to improve communication efficiency by transmitting only task-relevant information. However, ensuring robustness to the stochasticity of communication channels remains a key challenge in learning-based JSCC. In this paper, we propose a novel regularization technique for learning-based JSCC to enhance robustness against channel noise. The proposed method utilizes the Kullback-Leibler (KL) divergence as a regularizer term in the training loss, measuring the discrepancy between two posterior distributions: one under noisy channel conditions (noisy posterior) and one for a noise-free system (noise-free posterior). Reducing this KL divergence mitigates the impact of channel noise on task performance by keeping the noisy posterior close to the noise-free posterior. We further show that the expectation of the KL divergence given the encoded representation can be analytically approximated using the Fisher information matrix and the covariance matrix of the channel noise. Notably, the proposed regularization is architecture-agnostic, making it broadly applicable to general semantic communication systems over noisy channels. Our experimental results validate that the proposed regularization consistently improves task performance across diverse semantic communication systems and channel conditions.
