Practical applications of Set Shaping Theory to Non-Uniform Sequences
A. Schmidt, A. Vdberg, A.Petit

TL;DR
This paper demonstrates that Set Shaping Theory can be effectively applied to non-uniform sequences using approximate ordering, achieving theoretical shaping gains and extending previous uniform sequence results.
Contribution
It introduces an approximate ordering method for SST on non-uniform sequences, overcoming exponential complexity and confirming the theory's practical applicability.
Findings
Shaping gain persists for non-uniform sequences.
Approximate ordering preserves SST structural requirements.
Software implementation is publicly available for reproducibility.
Abstract
Set Shaping Theory (SST) moves beyond the classical fixed-space model by constructing bijective mappings the original sequence set into structured regions of a larger sequence space. These shaped subsets are characterized by a reduced average information content, measured by the product of the empirical entropy and the length, yielding (N +k)H0(f(s)) < NH0(s), which represents the universal coding limit when the source distribution is unknown. The principal experimental difficulty in applying Set Shaping Theory to non-uniform sequences arises from the need to order the sequences of both the original and transformed sets according to their information content. An exact ordering of these sets entails exponential complexity, rendering a direct implementation impractical. In this article, we show that this obstacle can be overcome by performing an approximate but informative ordering that…
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
TopicsComputability, Logic, AI Algorithms · Algorithms and Data Compression · Cellular Automata and Applications
