REVIEW 2 cited by
A Fast Transformer-based General-Purpose Lossless Compressor
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Deep-learning-based compressor has received interests recently due to much improved compression ratio. However, modern approaches suffer from long execution time. To ease this problem, this paper targets on cutting down the execution time of deep-learning-based compressors. Building history-dependencies sequentially (e.g., recurrent neural networks) is responsible for long inference latency. Instead, we introduce transformer into deep learning compressors to build history-dependencies in parallel. However, existing transformer is too heavy in computation and incompatible to compression tasks. This paper proposes a fast general-purpose lossless compressor, TRACE, by designing a compression-friendly structure based on a single-layer transformer. We first design a new metric to advise the selection part of compression model structures. Byte-grouping and Shared-ffn schemes are further proposed to fully utilize the capacity of the single-layer transformer. These features allow TRACE to achieve competitive compression ratio and a much faster speed. In addition, we further accelerate the compression procedure by designing a controller to reduce the parameter updating overhead. Experiments show that TRACE achieves an overall $\sim$3x speedup while keeps a comparable compression ratio to the state-of-the-art compressors. The source code for TRACE and links to the datasets are available at https://github.com/mynotwo/A-Fast-Transformer-based-General-Purpose-LosslessCompressor.
Forward citations
Cited by 2 Pith papers
-
Separate Source Channel Coding Is Still What You Need: An LLM-based Rethinking
LLM-based arithmetic coding plus ECCT-enhanced LDPC decoding makes separate source and channel coding competitive with, and in these tests superior to, joint source-channel coding for text under a total-energy comparison.
-
An Efficient Compression of Deep Neural Network Checkpoints Based on Prediction and Context Modeling
Using previous checkpoint values as LSTM context for arithmetic coding reduces compressed checkpoint size by 14% to 31% over ExCP on ViT-L32 and Pythia-410M, with the coding stage lossless.
Discussion (0). Continue with ORCID to comment.