Joint universal lossy coding and identification of stationary mixing sources
Information Theory
2007-07-13 v1 Machine Learning
math.IT
Abstract
The problem of joint universal source coding and modeling, treated in the context of lossless codes by Rissanen, was recently generalized to fixed-rate lossy coding of finitely parametrized continuous-alphabet i.i.d. sources. We extend these results to variable-rate lossy block coding of stationary ergodic sources and show that, for bounded metric distortion measures, any finitely parametrized family of stationary sources satisfying suitable mixing, smoothness and Vapnik-Chervonenkis learnability conditions admits universal schemes for joint lossy source coding and identification. We also give several explicit examples of parametric sources satisfying the regularity conditions.
Keywords
Cite
@article{arxiv.0704.2644,
title = {Joint universal lossy coding and identification of stationary mixing sources},
author = {Maxim Raginsky},
journal= {arXiv preprint arXiv:0704.2644},
year = {2007}
}
Comments
5 pages, 1 eps figure; to appear in Proc. ISIT 2007