Lossy Compressive Text Autoencoders

arXiv:2610.10738 · cs.CL · Submitted 2026-10-07 · Read on arXiv

cs.CL

Submitted: 2026-10-07

Updated: 2026-10-07

License: http://creativecommons.org/licenses/by-nc-nd/4.0/

The gist: Our work explores learning a compressed latent representation of text, at the intersection of data compression and representation learning.

Terminology

Abstract

Our work explores learning a compressed latent representation of text, at the intersection of data compression and representation learning. We propose an autoencoder architecture that performs residual downscaling and upscaling of hidden representations along the time axis, with a residual low-dimension discrete bottleneck. We analyze our approach for different quantization methods, training objectives, and datasets. For different levels of compression, we evaluate the similarity between the original and reconstructed text both at the surface-level (BLEU) and at the semantic-level (LLM-based judge). Additionally, we evaluate our models on downstream question-answering and semantic text similarity benchmarks. Our approach results in compressed representations which are on par with lossless text compression algorithms at 2.24 bits per byte on web text data, while having good reconstruction and downstream task performance.

Sources

Related papers