ITLGFeb 26, 2013

Rate-Distortion Bounds for an Epsilon-Insensitive Distortion Measure

arXiv:1302.6315v14 citations
Originality Incremental advance
AI Analysis

This work addresses a theoretical gap in information theory for compression with epsilon-insensitive loss, but it is incremental as it builds on known bounds and focuses on specific source distributions.

The paper tackled the problem of evaluating the rate-distortion function for an epsilon-insensitive distortion measure, proving that it exceeds the Shannon lower bound for Laplacian and Gaussian sources and providing analytically evaluable upper bounds, with numerical results showing the Shannon lower bound offers a good approximation.

Direct evaluation of the rate-distortion function has rarely been achieved when it is strictly greater than its Shannon lower bound. In this paper, we consider the rate-distortion function for the distortion measure defined by an epsilon-insensitive loss function. We first present the Shannon lower bound applicable to any source distribution with finite differential entropy. Then, focusing on the Laplacian and Gaussian sources, we prove that the rate-distortion functions of these sources are strictly greater than their Shannon lower bounds and obtain analytically evaluable upper bounds for the rate-distortion functions. Small distortion limit and numerical evaluation of the bounds suggest that the Shannon lower bound provides a good approximation to the rate-distortion function for the epsilon-insensitive distortion measure.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes