Rate-Distortion Theory for General Sets and Measures

04/24/2018
by   Erwin Riegler, et al.
0

This paper is concerned with a rate-distortion theory for sequences of i.i.d. random variables with general distribution supported on general sets including manifolds and fractal sets. Manifold structures are prevalent in data science, e.g., in compressed sensing, machine learning, image processing, and handwritten digit recognition. Fractal sets find application in image compression and in modeling of Ethernet traffic. We derive a lower bound on the (single-letter) rate-distortion function that applies to random variables X of general distribution and for continuous X reduces to the classical Shannon lower bound. Moreover, our lower bound is explicit up to a parameter obtained by solving a convex optimization problem in a nonnegative real variable. The only requirement for the bound to apply is the existence of a sigma-finite reference measure for X satisfying a certain subregularity condition. This condition is very general and prevents the reference measure from being highly concentrated on balls of small radii. To illustrate the wide applicability of our result, we evaluate the lower bound for a random variable distributed uniformly on a manifold, namely, the unit circle, and a random variable distributed uniformly on a self-similar set, namely, the middle third Cantor set.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/24/2021

Lossy Compression of General Random Variables

This paper is concerned with the lossy compression of general random var...
research
02/16/2021

Lower bound on Wyner's Common Information

An important notion of common information between two random variables i...
research
01/11/2018

An entropy inequality for symmetric random variables

We establish a lower bound on the entropy of weighted sums of (possibly ...
research
08/03/2020

On the Maximum Entropy of a Sum of Independent Discrete Random Variables

Let X_1, …, X_n be independent random variables taking values in the alp...
research
04/12/2019

Information Theoretic Lower Bounds on Negative Log Likelihood

In this article we use rate-distortion theory, a branch of information t...
research
01/12/2020

On the Compressibility of Affinely Singular Random Vectors

There are several ways to measure the compressibility of a random measur...
research
10/01/2020

Recoverable Systems

Motivated by the established notion of storage codes, we consider sets o...

Please sign up or login with your details

Forgot password? Click here to reset