MINE: Entropy-coded Memory-efficient Inference for Large Language Models
Organizations: Department of Computer Science, ETH Zurich, Zurich, Switzerland
Abstract
We present MINE (Memory-efficient INference Engine), a lossless entropy coding approach that accelerates single-stream inference of Large Language Models (LLMs), where existing lossless compression methods yield speedups only for specific data types such as BF16 and under additional assumptions. Single-stream decoding is strongly memory-bound, since every weight must be streamed from memory once per generated token and requests cannot be batched in local or low-latency deployments. At the core of MINE is dtANS-LLM, a GPU entropy coding scheme adapted from the prior dtANS to the needs of LLM inference. It exploits the non-uniform distribution of weights, which persists even after quantization, and exposes hyper-parameters that trade compression ratio against decoding cost. We auto-tune these parameters for each tensor and GPU to obtain the Pareto front between model size and decoding latency. MINE integrates into vLLM as a plugin and selects the best kernel configuration for a given memory budget. On Llama3.18BInstruct with a 2.1-bit EntQuant checkpoint, MINE achieves speedups of 2.52 and 1.48 over the fastest baseline on an RTX4060Ti and an RTX5090, at effective bitrates of 2.24 and 3.43~bits per weight. MINE is available as open source.
Figures & tables
Appendix figures & tables1 asset
Supplementary material from the paper’s appendix.
Appendix
| Result | Step |
|---|---|
| The 18 quantized checkpoints | run/01_checkpoints.sh |
| Entropy ; BF16 perplexity (reference of ZipServ’s gate) | run/02_stats.sh |
| Tune files and tune times | run/10_tune.sh |
| Decode throughput of MINE, vLLM (native / Marlin), and Humming | run/11_serve.sh |
| DFloat11, NeuZip, EntQuant (nvCOMP), ZipServ, and its vLLM 0.9.1 | run/12_baselines.sh |
| Prefill paragraph | run/13_prefill.sh |