PocketLLM: Ultimate Compression of Large Language Models via Meta Networks

Ye Tian, Chengcheng Wang, Jing Han, Yehui Tang, Kai Han
11/19/2025
cs.LGcs.CL

No official code found. Best implementation: 12z34x/PocketLLM (0 stars, MIT, last commit 2026-02-12).

Abstract

As Large Language Models (LLMs) continue to grow in size, storing and transmitting them on edge devices becomes increasingly challenging. Traditional methods like quantization and pruning struggle to achieve extreme compression of LLMs without sacrificing accuracy. In this paper, we introduce PocketLLM, a novel approach to compress LLMs in a latent space via meta-networks. A simple encoder network is proposed to project the weights of LLMs into discrete latent vectors, which are then represented using a compact codebook. A lightweight decoder network is employed to map the codebook's representative vectors back to the original weight space. This method allows for significant compression of the large weights in LLMs, consisting solely of a small decoder, a concise codebook, and an index. Extensive experiments show that PocketLLM achieves superior performance even at significantly high compression ratios, e.g., compressing Llama 2-7B by 10x with a negligible drop in accuracy.

View on arXivView PDF

Code Implementations(1)

12z34x/PocketLLMCommunity70%
MIT

Ultimate Compression for Large Language Models via Meta Networks

00Shell, PythonFeb 11, 20268 months agoMIT

Similar Papers

Cite this paper

@article{tian2025pocketllm,
  title  = {PocketLLM: Ultimate Compression of Large Language Models via Meta Networks},
  author = {Ye Tian and Chengcheng Wang and Jing Han and Yehui Tang and Kai Han},
  year   = {2025},
  eprint = {2511.17637},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2511.17637v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2511.17637.svg)](https://codeofpaper.com/paper/2511.17637)

Discussion