Universal Compression of a Mixture of Parametric Sources with Side Information
Ahmad Beirami, Liling Huang, Mohsen Sardari, Faramarz Fekri

TL;DR
This paper explores how side information from previous sequences can improve universal compression of data from a mixture of parametric sources, introducing clustering techniques and analyzing conditions for optimal redundancy reduction.
Contribution
It derives conditions under which side information reduces redundancy and proposes a clustering method to enhance compression performance.
Findings
Side information can significantly reduce redundancy in universal compression.
Clustering of side information sequences improves compression efficiency.
Simulation results validate the effectiveness of the proposed clustering approach.
Abstract
This paper investigates the benefits of the side information on the universal compression of sequences from a mixture of parametric sources. The output sequence of the mixture source is chosen from the source with a -dimensional parameter vector at random according to probability vector . The average minimax redundancy of the universal compression of a new random sequence of length is derived when the encoder and the decoder have a common side information of sequences generated independently by the mixture source. Necessary and sufficient conditions on the distribution and the mixture parameter dimensions are determined such that the side information provided by the previous sequences results in a reduction in the first-order term of the average codeword length compared…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Cellular Automata and Applications · DNA and Biological Computing
