English
Related papers

Related papers: Refined Asymptotics for Rate-Distortion using Gaus…

200 papers

We consider the rate-limited quantum-to-classical optimal transport in terms of output-constrained rate-distortion coding for both finite-dimensional and continuous-variable quantum-to-classical systems with limited classical common…

Quantum Physics · Physics 2023-11-30 Hafez M. Garmaroudi , S. Sandeep Pradhan , Jun Chen

Variable-length compression without prefix-free constraints and with side-information available at both encoder and decoder is considered. Instead of requiring the code to be error-free, we allow for it to have a non-vanishing error…

Information Theory · Computer Science 2020-08-24 Yuta Sakai , Vincent Y. F. Tan

This paper studies the rate-distortion-perception (RDP) tradeoff for a Gaussian vector source coding problem where the goal is to compress the multi-component source subject to distortion and perception constraints. Specifically, the RDP…

Information Theory · Computer Science 2025-03-18 Jingjing Qian , Sadaf Salehkalaibar , Jun Chen , Ashish Khisti , Wei Yu , Wuxian Shi , Yiqun Ge , Wen Tong

We deal with zero-delay source coding of a vector-valued Gauss-Markov source subject to a mean-squared error (MSE) fidelity criterion characterized by the operational zero-delay vector-valued Gaussian rate distortion function (RDF). We…

Information Theory · Computer Science 2018-10-02 Photios A. Stavrou , Jan Ostergaard , Charalambos D. Charalambous

Classical rate-distortion theory requires knowledge of an elusive source distribution. Instead, we analyze rate-distortion properties of individual objects using the recently developed algorithmic rate-distortion theory. The latter is based…

Information Theory · Computer Science 2007-07-16 Steven de Rooij , Paul Vitanyi

Rate-distortion formulation is the information-theoretic approach to the study of signal encoding systems. Since a more general approach to model the nonstationarity exhibited by real-world signals is to use appropriately fitted time…

Information Theory · Computer Science 2019-11-01 Jia-Chyi Wu

In this paper, we analyze the asymptotics of the normalized remaining uncertainty of a source when a compressed or hashed version of it and correlated side-information is observed. For this system, commonly known as Slepian-Wolf source…

Information Theory · Computer Science 2016-06-01 Vincent Y. F. Tan , Masahito Hayashi

In image compression, with recent advances in generative modeling, the existence of a trade-off between the rate and the perceptual quality (realism) has been brought to light, where the realism is measured by the closeness of the output…

Information Theory · Computer Science 2024-04-02 Yassine Hamdi , Aaron B. Wagner , Deniz Gündüz

Consider a lossy compression system with $\ell$ distributed encoders and a centralized decoder. Each encoder compresses its observed source and forwards the compressed data to the decoder for joint reconstruction of the target signals under…

Information Theory · Computer Science 2018-07-19 Yizhong Wang , Li Xie , Xuan Zhang , Jun Chen

In the theory of lossy compression, the rate-distortion (R-D) function $R(D)$ describes how much a data source can be compressed (in bit-rate) at any given level of fidelity (distortion). Obtaining $R(D)$ for a given data source establishes…

Information Theory · Computer Science 2023-10-31 Yibo Yang , Stephan Eckstein , Marcel Nutz , Stephan Mandt

This paper studies the joint data and semantics lossy compression problem, i.e., an extension of the hidden lossy source coding problem that entails recovering both the hidden and observable sources. We aim to study the nonasymptotic and…

Information Theory · Computer Science 2024-08-20 Huiyuan Yang , Yuxuan Shi , Shuo Shao , Xiaojun Yuan

In this paper, we propose a variant of Riemannian stochastic recursive gradient method that can achieve second-order convergence guarantee and escape saddle points using simple perturbation. The idea is to perturb the iterates when gradient…

Optimization and Control · Mathematics 2020-10-30 Andi Han , Junbin Gao

We present the first unified framework for rate-distortion-optimized compression and segmentation of 3D Gaussian Splatting (3DGS). While 3DGS has proven effective for both real-time rendering and semantic scene understanding, prior works…

Computer Vision and Pattern Recognition · Computer Science 2026-01-21 Yu-Jen Tseng , Chia-Hao Kao , Jing-Zhong Chen , Alessandro Gnutti , Shao-Yuan Lo , Yen-Yu Lin , Wen-Hsiao Peng

This paper investigates the best known bounds on the quadratic Gaussian distortion-rate-perception function with limited common randomness for the Kullback-Leibler divergence-based perception measure, as well as their counterparts for the…

Information Theory · Computer Science 2024-09-05 Li Xie , Liangyan Li , Jun Chen , Lei Yu , Zhongshan Zhang

This paper shows new general nonasymptotic achievability and converse bounds and performs their dispersion analysis for the lossy compression problem in which the compressor observes the source through a noisy channel. While this problem is…

Information Theory · Computer Science 2016-09-19 Victoria Kostina , Sergio Verdú

We quantify the large deviations of Gaussian extreme value statistics on closed convex sets in d-dimensional Euclidean space. The asymptotics imply that the extreme value distribution exhibits a rate function that is a simple quadratic…

Probability · Mathematics 2018-10-31 Harsha Honnappa , Raghu Pasupathy , Prateek Jaiswal

It is well known that independent (separate) encoding of K correlated sources may incur some rate loss compared to joint encoding, even if the decoding is done jointly. This loss is particularly evident in the multiple descriptions problem,…

Information Theory · Computer Science 2022-05-23 Jan Østergaard , Uri Erez , Ram Zamir

Rate-distortion-perception theory generalizes Shannon's rate-distortion theory by introducing a constraint on the perceptual quality of the output. The perception constraint complements the conventional distortion constraint and aims to…

Information Theory · Computer Science 2022-04-14 Jun Chen , Lei Yu , Jia Wang , Wuxian Shi , Yiqun Ge , Wen Tong

In centralized, distributed, and federated learning with stochastic gradients and $n$ workers, it was recently shown that it is infeasible to find an $\varepsilon$-stationary point faster than $\tilde{\Omega}\left(\min\left\{\frac{d \kappa…

Optimization and Control · Mathematics 2026-05-11 Grigory Begunov , Alexander Tyurin

We study the problem of rate-distortion-equivocation with side-information only available at the decoder when an independent private random key is shared between the sender and the receiver. The sender compresses the sequence, and the…

Information Theory · Computer Science 2022-01-25 Hamid Ghourchian , Photios A. Stavrou , Tobias J. Oechtering , Mikael Skoglund
‹ Prev 1 4 5 6 7 8 10 Next ›