Rate-Distortion-Perception Theory: Redefining the Fundamental Limits of Information Representation

• URL: http://arxiv.org/abs/2607.17232v1
• Date: Sun, 19 Jul 2026 12:55:43 GMT
• Title: Rate-Distortion-Perception Theory: Redefining the Fundamental Limits of Information Representation
• Abstract summary: Rate-distortion-perception (RDP) theory extends the RD framework by introducing perception as a third fundamental axis.<n>Special attention is given to computational tools such as alternating schemes, Newton-based methods, and convex optimization.
• Score: 9.788112471288057
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Classical rate-distortion (RD) theory has long established the fundamental limits of lossy compression by quantifying the minimum number of bits required to represent a source under a prescribed distortion constraint. However, widely used distortion measures such as mean-squared error often fail to capture perceptual quality or semantic validity, which are increasingly central in modern learning-driven applications. Rate-distortion-perception (RDP) theory extends the RD framework by introducing perception as a third fundamental axis, quantified via distributional similarity between the source and reconstructed signals, leading to the rate-distortion-perception function (RDPF). This tutorial provides a structured overview of the coding principles underlying perception-aware lossy compression and surveys recent achievability results under different randomness assumptions. It then presents a unifying optimization viewpoint for computing the RDPF as defined by Blau and Michaeli, for both discrete and continuous sources under broad families of perceptual constraints, including f-divergences, alpha-divergences, and Wasserstein-based metrics. Special attention is given to computational tools such as alternating minimization schemes, Newton-based methods, and convex optimization formulations, as well as to analytically tractable cases such as Gaussian sources and the perfect-realism regime. Unlike recent broad surveys that emphasize generative architectures and AI-empowered communication systems, this tutorial focuses on the coding-theoretic and computational machinery needed to characterize, compute, and interpret the RDP limits. Finally, the tutorial outlines promising research directions at the intersection of information theory, neural compression, robust source coding, and perception-aware networked control systems.

Related papers

• JSCGC: Joint Source-Channel-Generation Coding for Wireless Generative Communications [58.67925548779465]
  Joint Source-Channel-Generation Coding (JSCGC) is a generative communication paradigm that replaces the conventional decoder with a generative model at the receiver.<n>JSCGC consistently improves feature-based, semantic-level, and inferenceal quality across diverse channel conditions.
  arXiv  Detail & Related papers  (2026-06-11T03:42:03Z)
• A Synonymous Variational Perspective on the Rate-Distortion-Perception Tradeoff [13.751084926770773]
  In this paper, motivated by a synonymity-based semantic information perspective, we reformulate reconstruction as recovering any admissible sample within an ideal synonymous set (synset) associated with the source.<n>We show that the distributional divergence term arises naturally from the synset-based reconstruction objective, clarify its compatibility with existing formulations and classical RD theory, and suggest the potential advantages of synonymous source coding.
  arXiv  Detail & Related papers  (2026-04-16T04:21:32Z)
• On the Rate-Distortion-Complexity Tradeoff for Semantic Communication [42.300429885256435]
  This paper proposes a rate-distortion-complexity (RDC) framework which extends the classical rate-distortion theory.<n>We derive the theoretical results of the minimum achievable rate under given constraints on semantic distance and complexity.<n>Our results show a fundamental three-way tradeoff among achievable rate, semantic distance, and model complexity.
  arXiv  Detail & Related papers  (2026-02-16T05:45:52Z)
• Semantic Rate Distortion and Posterior Design: Compute Constraints, Multimodality, and Strategic Inference [0.0]
  We study strategic Gaussian semantic compression under rate and compute constraints, where an encoder and decoder optimize distinct quadratic objectives.<n>We characterize the strategic rate distortion function in direct, remote, and full information regimes, derive semantic waterfilling and rate constrained Gaussian persuasion solutions, and establish Gaussian optimality under misaligned objectives.<n>These results provide information theoretic foundations for data and energy efficient AI and offer a principled interpretation of modern multimodal language models as posterior design mechanisms under resource constraints.
  arXiv  Detail & Related papers  (2026-02-03T19:12:02Z)
• Implicit Neural Representation-Based Continuous Single Image Super Resolution: An Empirical Study [50.15623093332659]
  Implicit neural representation (INR) has become the standard approach for arbitrary-scale image super-resolution (ASSR)<n>We compare existing techniques across diverse settings and present aggregated performance results on multiple image quality metrics.<n>We examine a new loss function that penalizes intensity variations while preserving edges, textures, and finer details during training.
  arXiv  Detail & Related papers  (2026-01-25T07:09:20Z)
• Joint Source-Channel-Generation Coding: From Distortion-oriented Reconstruction to Semantic-consistent Generation [58.67925548779465]
  We propose Joint Source-Channel-Generation Coding (JSCGC), a novel paradigm that shifts the focus from perceptual reconstruction to probabilistic generation.<n>JSCGC improves substantially semantic quality and semantic fidelity, significantly outperforming conventional distortion-oriented J SCC methods.
  arXiv  Detail & Related papers  (2026-01-19T08:12:47Z)
• The Larger the Merrier? Efficient Large AI Model Inference in Wireless Edge Networks [56.37880529653111]
  The demand for large computation model (LAIM) services is driving a paradigm shift from traditional cloud-based inference to edge-based inference for low-latency, privacy-preserving applications.<n>In this paper, we investigate the LAIM-inference scheme, where a pre-trained LAIM is pruned and partitioned into on-device and on-server sub-models for deployment.
  arXiv  Detail & Related papers  (2025-05-14T08:18:55Z)
• On Self-Adaptive Perception Loss Function for Sequential Lossy Compression [29.361832071511795]
  We consider causal, low-latency, sequential lossy compression, with mean squared-error (MSE) as the distortion loss, and a perception loss function (PLF) to enhance the realism of reconstructions.<n>We establish the theoretical rate-distortion-perception function for first-order Markov sources and analyze the Gaussian model in detail.<n>The proposed metric is referred to as self-adaptive perception loss function (PLF-SA), as its behavior adapts to the quality of reconstructed frames.
  arXiv  Detail & Related papers  (2025-02-15T01:41:53Z)
• Causal Context Adjustment Loss for Learned Image Compression [72.7300229848778]
  In recent years, learned image compression (LIC) technologies have surpassed conventional methods notably in terms of rate-distortion (RD) performance. Most present techniques are VAE-based with an autoregressive entropy model, which obviously promotes the RD performance by utilizing the decoded causal context. In this paper, we make the first attempt in investigating the way to explicitly adjust the causal context with our proposed Causal Context Adjustment loss.
  arXiv  Detail & Related papers  (2024-10-07T09:08:32Z)
• The Rate-Distortion-Perception-Classification Tradeoff: Joint Source Coding and Modulation via Inverse-Domain GANs [4.735670734773145]
  We show the existence of a strict tradeoff between channel rate, distortion perception, and classification accuracy. We propose two image compression methods to navigate that tradeoff: theCO algorithm and ID-GAN, which is more general compression. They also demonstrate that the proposed ID-GAN algorithm balances image distortion, perception, classification accuracy, and significantly outperforms traditional separation-based methods.
  arXiv  Detail & Related papers  (2023-12-22T16:06:43Z)
• Compressed Regression over Adaptive Networks [58.79251288443156]
  We derive the performance achievable by a network of distributed agents that solve, adaptively and in the presence of communication constraints, a regression problem. We devise an optimized allocation strategy where the parameters necessary for the optimization can be learned online by the agents.
  arXiv  Detail & Related papers  (2023-04-07T13:41:08Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.