RDD Function: A Tradeoff Between Rate and Distortion-in-Distortion

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Chen, Lingyi, Tang, Haoran, Wu, Shitong, Liu, Jiakun, Wu, Huihui, Zhang, Wenyi, Wu, Hao
Formato: Preprint
Publicado: 2025
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866911073814183936
author Chen, Lingyi
Tang, Haoran
Wu, Shitong
Liu, Jiakun
Wu, Huihui
Zhang, Wenyi
Wu, Hao
author_facet Chen, Lingyi
Tang, Haoran
Wu, Shitong
Liu, Jiakun
Wu, Huihui
Zhang, Wenyi
Wu, Hao
contents In this paper, we propose a novel function named Rate Distortion-in-Distortion (RDD) function as an extension of the classical rate-distortion (RD) function, where the expected distortion constraint is replaced by a Gromov-type distortion. This distortion, integral to the Gromov-Wasserstein (GW) distance, effectively defines the similarity in spaces of possibly different dimensions even without a direct metric between them. While the RDD function qualifies as an informational RD function, encoding theorems substantiate its status as an operational RD function, thereby underscoring its potential applicability in real-world source coding. Due to the high computational complexity associated with Gromov-type distortion, in general, the RDD function cannot be evaluated analytically. Consequently, we develop an alternating mirror descent algorithm that significantly reduces computational complexity by employing decomposition, linearization, and relaxation techniques. Numerical results on classical sources and different grids demonstrate the effectiveness of the developed algorithm. By exploring the relationship between the RDD function and the RD function, we suggest that the RDD function may have potential applications in future scenarios.
format Preprint
id arxiv_https___arxiv_org_abs_2507_09712
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle RDD Function: A Tradeoff Between Rate and Distortion-in-Distortion
Chen, Lingyi
Tang, Haoran
Wu, Shitong
Liu, Jiakun
Wu, Huihui
Zhang, Wenyi
Wu, Hao
Information Theory
In this paper, we propose a novel function named Rate Distortion-in-Distortion (RDD) function as an extension of the classical rate-distortion (RD) function, where the expected distortion constraint is replaced by a Gromov-type distortion. This distortion, integral to the Gromov-Wasserstein (GW) distance, effectively defines the similarity in spaces of possibly different dimensions even without a direct metric between them. While the RDD function qualifies as an informational RD function, encoding theorems substantiate its status as an operational RD function, thereby underscoring its potential applicability in real-world source coding. Due to the high computational complexity associated with Gromov-type distortion, in general, the RDD function cannot be evaluated analytically. Consequently, we develop an alternating mirror descent algorithm that significantly reduces computational complexity by employing decomposition, linearization, and relaxation techniques. Numerical results on classical sources and different grids demonstrate the effectiveness of the developed algorithm. By exploring the relationship between the RDD function and the RD function, we suggest that the RDD function may have potential applications in future scenarios.
title RDD Function: A Tradeoff Between Rate and Distortion-in-Distortion
topic Information Theory
url https://arxiv.org/abs/2507.09712