Skip to Content
EntropyEntropy
  • Article
  • Open Access

10 June 2019

16 Pages

Universality of Logarithmic Loss in Fixed-Length Lossy Compression †

Department of Electronic and Electrical Engineering, Hongik University, Seoul 04066, Korea
†
This paper is an extended version of our paper published in the 2015 IEEE International Symposium on Information Theory (ISIT), Hong Kong, China, 14–19 June 2015.
This article belongs to the Special Issue Bayesian Inference and Information Theory

Abstract

We established a universality of logarithmic loss over a finite alphabet as a distortion criterion in fixed-length lossy compression. For any fixed-length lossy-compression problem under an arbitrary distortion criterion, we show that there is an equivalent lossy-compression problem under logarithmic loss. The equivalence is in the strong sense that we show that finding good schemes in corresponding lossy compression under logarithmic loss is essentially equivalent to finding good schemes in the original problem. This equivalence relation also provides an algebraic structure in the reconstruction alphabet, which allows us to use known techniques in the clustering literature. Furthermore, our result naturally suggests a new clustering algorithm in the categorical data-clustering problem.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.