Next Article in Journal
Boltzmann–Loschmidt Dispute Reloaded: Quantum 150 Years Later
Previous Article in Journal
S2-HGNN: Scale-Aware Hypergraph Node Classification with Spectral Inductive Bias
Previous Article in Special Issue
Coded Caching Scheme for Multiaccess Cache-Assisted Partially Connected Linear Network via Multi-Antenna Placement Delivery Array
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Rate–Distortion Limits for Task-Oriented Compression with Side Information

1
School of Cyber Science and Engineering, Southeast University, Nanjing 210096, China
2
Ningbo Institute of Digital Twin, Eastern Institute of Technology, Ningbo 315200, China
3
Ningbo Key Laboratory of Spatial Intelligence and Digital Derivative, Ningbo 315200, China
4
School of Economics, University of Nottingham Ningbo China, Ningbo 315100, China
*
Author to whom correspondence should be addressed.
Entropy 2026, 28(6), 593; https://doi.org/10.3390/e28060593
Submission received: 20 April 2026 / Revised: 21 May 2026 / Accepted: 22 May 2026 / Published: 26 May 2026
(This article belongs to the Special Issue Network Information Theory and Its Applications)

Abstract

This paper analyzes the semantic rate–distortion problem motivated by task-oriented data compression with side information. The semantic information related to a task is not directly accessible to the encoder but implicitly impacts the observations through a joint probability distribution. The decoder aims to simultaneously recover the observation and infer the semantic information under certain distortion constraints. Notably, this paper advances the related research by involving side information and the observation of two semantic segments at both the encoder and decoder, which significantly complicates the theoretic analysis. We establish the information-theoretic limits for the tradeoff between compression rates and distortions by fully characterizing the rate–distortion function. Additionally, we explicitly derive the corresponding rate–distortion functions under specific Markov conditions for two scenarios: (i) the task is a binary classification of an integer observation as even and odd; and (ii) Gaussian-correlated task and observation. Furthermore, we validate the information-theoretic analysis by conducting a classification-oriented lossy image compression based on deep learning. The results are consistent with theoretical expectations, demonstrating the effectiveness of side information on both distortion and classification accuracy and the rationality of semantic segmentation.
Keywords: semantic compression; rate–distortion function; side information semantic compression; rate–distortion function; side information

Share and Cite

MDPI and ACS Style

Guo, T.; Song, Z.; Wu, H.; Li, Y. Rate–Distortion Limits for Task-Oriented Compression with Side Information. Entropy 2026, 28, 593. https://doi.org/10.3390/e28060593

AMA Style

Guo T, Song Z, Wu H, Li Y. Rate–Distortion Limits for Task-Oriented Compression with Side Information. Entropy. 2026; 28(6):593. https://doi.org/10.3390/e28060593

Chicago/Turabian Style

Guo, Tao, Zhangyao Song, Huihui Wu, and Yang Li. 2026. "Rate–Distortion Limits for Task-Oriented Compression with Side Information" Entropy 28, no. 6: 593. https://doi.org/10.3390/e28060593

APA Style

Guo, T., Song, Z., Wu, H., & Li, Y. (2026). Rate–Distortion Limits for Task-Oriented Compression with Side Information. Entropy, 28(6), 593. https://doi.org/10.3390/e28060593

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop