HyperZip: Efficient Data Compression through Personalized Diffusion LLMs with Hypernetworks

Thai Nguyen, Khang Tran, NhatHai Phan
9/28/2026
cs.AI

No confident code implementation found for this paper.

Abstract

Large language models (LLMs) have shown strong potential for lossless data compression, but existing approaches are constrained by the high computational cost and low throughput of autoregressive decoding. We propose HyperZip, an efficient and scalable LLM-based compression framework that leverages diffusion-based LLMs (dLLMs) with Multi-Token Prediction (MTP) to accelerate LLM-based data compression processes. We identify a trade-off in diffusion-based compression, where increasing decoding throughput degrades the compression rate. To mitigate this trade-off, HyperZip employs a hypernetwork to generate data-specific updates from a context representation, adapting the dLLM to the target data without costly fine-tuning, resulting in a low compression rate and high throughput. Extensive experiments show that HyperZip achieves a superior trade-off between compression rate and speed compared with state-of-the-art baselines.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{nguyen2026hyperzip,
  title  = {HyperZip: Efficient Data Compression through Personalized Diffusion LLMs with Hypernetworks},
  author = {Thai Nguyen and Khang Tran and NhatHai Phan},
  year   = {2026},
  eprint = {2609.36357},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2609.36357v1}
}

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/2609.36357.svg)](https://codeofpaper.com/paper/2609.36357)

Discussion