PocketLLM: Ultimate Compression of Large Language Models via Meta Networks
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 19 of its 34 references that are in the map. First posted on arXiv 19 Nov 2025.
Builds on
19 of 34 references.
References · 19
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,031
- 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,838
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2022ZeroQuant: Efficient and Affordable Post-Training Quantization for Large-Scale Transformerscited by 517
- 2023SpQR: A Sparse-Quantized Representation for Near-Lossless LLM Weight Compressioncited by 359
- 2024QuIP#: Even Better LLM Quantization with Hadamard Incoherence and Lattice Codebookscited by 354
- 2024Extreme Compression of Large Language Models via Additive Quantizationcited by 223
7 more
- 2024DuQuant: Distributing Outliers via Dual Transformation Makes Stronger Quantized LLMscited by 165
- 2024QTIP: Quantization with Trellises and Incoherence Processingcited by 86
- 2018A Systematic Classification of Knowledge, Reasoning, and Context within the ARC Datasetcited by 54
- 2024Adaptive Feature-based Low-Rank Compression of Large Language Models via Bayesian Optimizationcited by 9
- 2025Gumiho: A Hybrid Architecture to Prioritize Early Tokens in Speculative Decodingcited by 9
- 2025SparK: Query-Aware Unstructured Sparsity with Recoverable KV Cache Channel Pruningcited by 6
- 2025SLMQuant:Benchmarking Small Language Model Quantization for Practical Deploymentcited by 2
Built on by
Citing papers per year: 2026: 3.
3 papers.
- 2026Saliency-Aware Regularized Quantization Calibration for Large Language Modelscited by 2
- 2026Understanding Performance Collapse in Layer-Pruned Large Language Models via Decision Representation Transitionscited by 2
- 2026BiSCo-LLM: Lookup-Free Binary Spherical Coding for Extreme Low-Bit Large Language Model Compressioncited by 0
- 2026BiSCo-LLM: Lookup-Free Binary Spherical Coding for Extreme Low-Bit Large Language Model Compression9 Jul 2026
- 2026Understanding Performance Collapse in Layer-Pruned Large Language Models via Decision Representation Transitions8 May 2026
- 2026Saliency-Aware Regularized Quantization Calibration for Large Language Models7 May 2026