Tackling Distribution Shifts in Task-Oriented Communication With Information Bottleneck
Task-oriented communication aims to extract and transmit task-relevant information to significantly reduce the communication overhead and transmission latency. However, the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">unpredictable</i> distribution shifts between training and test data, including <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">domain shift</i> and <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">semantic shift</i>, can dramatically undermine the system performance. In order to tackle these challenges, it is crucial to ensure that the encoded features can generalize to <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">domain-shifted</i> data and detect <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">semantic-shifted</i> data, while remaining compact for transmission. In this paper, we propose a novel approach based on the information bottleneck (IB) principle and invariant risk minimization (IRM) framework. The proposed method aims to extract compact and informative features that possess high capability for effective <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">domain-shift generalization</i> and accurate <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">semantic-shift detection</i> without any knowledge of the test data during training. Specifically, we propose an invariant feature encoding approach based on the IB principle and IRM framework for <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">domain-shift</i> generalization, which aims to find the causal relationship between the input data and task result by minimizing the complexity and domain dependence of the encoded feature. Furthermore, we enhance the task-oriented communication with the label-dependent feature encoding approach for <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">semantic-shift detection</i> which achieves joint gains in IB optimization and detection performance. To avoid the intractable computation of the IB-based objective, we leverage variational approximation to derive a tractable upper bound for optimization. Extensive simulation results on image classification tasks demonstrate that the proposed scheme outperforms state-of-the-art approaches and achieves a better rate-distortion tradeoff.
Authors
- Shenghui Song (ORCID: https://orcid.org/0000-0001-6316-8415)
- Hengtao He (ORCID: https://orcid.org/0000-0002-4659-6941)
- Khaled B. Letaief (ORCID: https://orcid.org/0000-0003-2519-6401)
- Jun Zhang (ORCID: https://orcid.org/0000-0002-5222-1898)
- Jiawei Shao (ORCID: https://orcid.org/0000-0001-8836-1430)
- Hongru Li (ORCID: https://orcid.org/0009-0008-1847-9626)
Institutions
- Hong Kong University of Science and Technology (HK)
- China Telecom (China) (CN)
- China Telecom (CN)
Publication Details
- Journal
- IEEE Journal on Selected Areas in Communications
- Published
- 2025-04-15
- DOI
- https://doi.org/10.1109/jsac.2025.3559116
- Citations
- 5
- Primary Topic
- Cognitive Computing and Networks
- Type
- article
- Field-Weighted Citation Impact
- 12.40