mlsanityData to 7 Oct 2026

Seq2Seq2Seq: Lossless Data Compression via Discrete Latent Transformers and Reinforcement Learning

arXiv 2602.12146 ↗First posted 12 Feb 2026cs.AI cs.CL cs.ITcited by 0

Not on the map. Why?

Abstract (arXiv)

Efficient lossless compression is essential for minimizing storage costs and transmission overhead while preserving data integrity. Traditional compression techniques, such as dictionary-based and statistical methods, often struggle to optimally exploit the structure and redundancy in complex data formats. Recent advancements in deep learning have opened new avenues for compression; however, many existing approaches depend on dense vector representations that obscure the underlying token structure. To address these limitations, we propose a novel lossless compression method that leverages Reinforcement Learning applied to a T5 language model architecture. This approach enables the compression of data into sequences of tokens rather than traditional vector representations. Unlike auto-encoders, which typically encode information into continuous latent spaces, our method preserves the token-based structure, aligning more closely with the original data format. This preservation allows for higher compression ratios while maintaining semantic integrity. By training the model using an off-policy Reinforcement Learning algorithm, we optimize sequence length to minimize redundancy and enhance compression efficiency. Our method introduces an efficient and adaptive data compression system built upon advanced Reinforcement Learning techniques, functioning independently of external grammatical or world knowledge. This approach shows significant improvements in compression ratios compared to conventional methods. By leveraging the latent information within language models, our system effectively compresses data without requiring explicit content understanding, paving the way for more robust and practical compression solutions across various applications.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 16 of its 47 references that are in the map. First posted on arXiv 12 Feb 2026.

Builds on

16 of 47 references.

References · 16

  1. 2017Attention Is All You Needcited by 59,932
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  4. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  5. 2017Neural Discrete Representation Learningcited by 4,650
  6. 2018HAQ: Hardware-Aware Automated Quantization with Mixed Precisioncited by 426
  7. 2021Reinforcement Learning with Prototypical Representationscited by 179
  8. 2022Transformer Language Models without Positional Encodings Still Learn Positional Informationcited by 148
  9. 2021Studying the Usage of Text-To-Text Transfer Transformer to Support Code-Related Taskscited by 70
  10. 2018DeepZip: Lossless Data Compression using Recurrent Neural Networkscited by 32
  11. 2021DECORE: Deep Compression with Reinforcement Learningcited by 29
  12. 2024TACO-RL: Task Aware Prompt Compression Optimization with Reinforcement Learningcited by 22
4 more
  1. 2024Compression via Pre-trained Transformers: A Study on Byte-Level Multimodal Datacited by 13
  2. 2020Generalized Rational Variable Projection With Application in ECG Compressioncited by 3
  3. 2021An advantage actor-critic algorithm for robotic motion planning in dense and dynamic scenarioscited by 1
  4. 2022Recursive Least Squares Advantage Actor-Critic Algorithmscited by 1

Built on by

Not cited yet.