2024/06/24 by Ziguang Li, Chao Huang, Xuliang Wang +7 · 2 voices · 2 citations
Computer Science · #Advanced Data Compression Techniques #Algorithms and Data Compression #Error Correcting Code Techniques #cs.AI #cs.IT
paper · pdf · doi:10.1038/s42256-025-01033-7
arxiv published 2024/06/24 · arxiv updated 2025/04/30 · openalex publication_date 2025/05/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/23
Modern data compression methods are slowly reaching their limits after 80 years of research, millions of papers, and wide range of applications. Yet, the extravagant 6G communication speed requirement raises a major open question for revolutionary new ideas of data compression. We have previously shown all understanding or learning are compression, under reasonable assumptions. Large language models (LLMs) understand data better than ever before. Can they help us to compress data? The LLMs may be seen to approximate the uncomputable Solomonoff induction. Therefore, under this new uncomputable paradigm, we present LMCompress. LMCompress shatters all previous lossless compression algorithms, doubling the lossless compression ratios of JPEG-XL for images, FLAC for audios, and H.264 for videos, and quadrupling the compression ratio of bz2 for texts. The better a large model understands the data, the better LMCompress compresses.