Pith. sign in

REVIEW 1 cited by

ZipNN: Lossless Compression for AI Models

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

arxiv 2411.05239 v2 pith:UNN3ZQQI submitted 2024-11-07 cs.LG cs.ITmath.IT

classification cs.LGcs.ITmath.IT
keywords compressionmodellosslessmodelsnetworksizezipnndecompression
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

With the growth of model sizes and the scale of their deployment, their sheer size burdens the infrastructure requiring more network and more storage to accommodate these. While there is a vast model compression literature deleting parts of the model weights for faster inference, we investigate a more traditional type of compression - one that represents the model in a compact form and is coupled with a decompression algorithm that returns it to its original form and size - namely lossless compression. We present ZipNN a lossless compression tailored to neural networks. Somewhat surprisingly, we show that specific lossless compression can gain significant network and storage reduction on popular models, often saving 33% and at times reducing over 50% of the model size. We investigate the source of model compressibility and introduce specialized compression variants tailored for models that further increase the effectiveness of compression. On popular models (e.g. Llama 3) ZipNN shows space savings that are over 17% better than vanilla compression while also improving compression and decompression speeds by 62%. We estimate that these methods could save over an ExaByte per month of network traffic downloaded from a large model hub like Hugging Face.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Huff-LLM: End-to-End Lossless Compression for Efficient LLM Inference

    cs.LG 2025-02 conditional novelty 6.0 of 10

    Huff-LLM splits FP16/BF16 LLM weights into small bit groups, Huffman-compresses each group, and uses custom hardware decoders so weights stay compressed through the memory hierarchy during inference.

Pith tools