Joint universal lossy coding and identification of stationary mixing sources

Simple item page
dc.creatorRaginsky, Maxim
dc.date2007-04-20
dc.date.accessioned2026-07-07T08:15:57Z
dc.date.available2026-07-07T08:15:57Z
dc.descriptionThe 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.
dc.description5 pages, 1 eps figure; to appear in Proc. ISIT 2007
dc.identifierhttps://arxiv.org/abs/0704.2644
dc.identifierhttp://arxiv.org/abs/0704.2644
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133619
dc.subjectInformation Theory
dc.subjectMachine Learning
dc.titleJoint universal lossy coding and identification of stationary mixing sources
dc.typetext

Files

Collections

arXiv