A Model-Driven Lossless Compression Algorithm Resistant to Mismatch

TL;DR

This paper introduces a lossless compression algorithm based on next-token prediction that remains reliable despite large, structured prediction mismatches, outperforming standard methods in compression efficiency.

Contribution

It presents a novel, mismatch-robust compression scheme with formal correctness proof and validated performance on real datasets.

Findings

Reliable operation within the certified mismatch regime

Achieves higher compression ratios than standard methods

Proven correctness under formal mismatch certification

Abstract

Due to the fundamental connection between next-symbol prediction and compression, modern predictive models, such as large language models (LLMs), can be combined with entropy coding to achieve compression rates that surpass those of standard compression algorithms. However, this approach relies on the assumption that the predictive model produces identical output distributions at both the encoder and decoder, since even small mismatches can cause the decoding to fail. This assumption often fails with complex predictive models, particularly those based on neural networks, a phenomenon referred to as non-determinism. In this work, we propose a new compression algorithm based on next-token prediction that is robust to arbitrarily large, but structured, prediction mismatches. We prove the correctness of the proposed scheme under a formal mismatch certification, characterize its theoretical performance, and validate it experimentally on real datasets. Our results demonstrate reliable operation within the certified mismatch regime while achieving compression ratios that exceed those of commonly used compression methods.