pith. sign in

arxiv: 1203.6791 · v1 · pith:AUSSW2J6new · submitted 2012-03-30 · 💻 cs.IT · math.IT

Relative Information Loss - An Introduction

classification 💻 cs.IT math.IT
keywords informationlossrelativeabsolutebehaviorboundcharacterizeclass
0
0 comments X
read the original abstract

We introduce a relative variant of information loss to characterize the behavior of deterministic input-output systems. We show that the relative loss is closely related to Renyi's information dimension. We provide an upper bound for continuous input random variables and an exact result for a class of functions (comprising quantizers) with infinite absolute information loss. A connection between relative information loss and reconstruction error is investigated.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.