Good Papers

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

Huff-LLM enables end-to-end lossless LLM weight compression across storage and memory to reduce inference latency, energy, and bandwidth.

Patrick Yubeaton, Mahmoud, Tareq, Shehab Naga, Pooria Taheri, Tianhua Xia, Arun George, Yasmein Khalil, Sai Qian Zhang, Joshi, Siddharth, Chinmay Hegde, Siddharth Garg

Published Feb 2, 2025arXiv ↗

69%
OverallHighly rated
?
OverallHighly ratedVote to see the score
Readers
–

Only vote on papers you've read. Sign in to vote.

AI panel6/20reviewers recommend it
lenient 4/5
medium 2/10
strict 0/5
AI panel?Vote to see what the 20 AI reviewers said

Abstract

As they become more capable, large language models (LLMs) have continued to rapidly increase in size. This has exacerbated the difficulty in running state of the art LLMs on small, edge devices. Standard techniques advocate solving this problem through lossy compression techniques such as quantization or pruning. However, such compression techniques are lossy, and have been shown to change model behavior in unpredictable manners. We propose Huff-LLM, an \emph{end-to-end, lossless} model compression method that lets users store LLM weights in compressed format \emph{everywhere} -- cloud, disk, main memory, and even in on-chip memory/buffers. This allows us to not only load larger models in main memory, but also reduces bandwidth required to load weights on chip, and makes more efficient use of on-chip weight buffers. In addition to the memory savings achieved via compression, we also show latency and energy efficiency improvements when performing inference with the compressed model.