Zero-Shot Knowledge Base Resizing for Rate-Adaptive Digital Semantic Communication

TL;DR

This paper introduces a zero-shot method for dynamically resizing the knowledge base in VQ-VAE-based semantic communication systems, enabling flexible rate adaptation without retraining and maintaining high reconstruction quality.

Contribution

We propose a novel hierarchical KB resizing approach using hyperbolic embedding and semantic tree construction, allowing instant rate adaptation without retraining.

Findings

Achieves near-scratch quality with minimal computational cost

Enables flexible, on-the-fly rate adaptation in semantic communication

Demonstrates robustness at very low rates, preventing catastrophic failure

Abstract

Digital semantic communication systems, which often leverage the Vector Quantized Variational Autoencoder (VQ-VAE) framework, are pivotal for future wireless networks. In a VQ-VAE-based semantic communication system, the transmission rate is directly governed by the size of a discrete codebook known as knowledge base (KB). However, the KB size is a fixed hyperparameter, meaning that adapting the rate requires training and storing a separate model for each desired size -- a practice that is too computationally and storage-prohibitive to achieve truly granular rate control. To address this, we introduce a principled, zero-shot KB resizing method that enables on-the-fly rate adaptation without any retraining. Our approach establishes a global importance ranking for all vectors within a single, large parent KB by uncovering its inherent semantic hierarchy. This is achieved via a three-step framework: 1) embedding KB vectors into hyperbolic space to reveal their hierarchical relationships; 2) constructing a master semantic tree using a minimum spanning tree algorithm; 3) enabling instant resizing by iteratively pruning the least important leaf nodes. Extensive simulations demonstrate that our method achieves reconstruction quality nearly identical to that of dedicated KBs trained from scratch, while demanding only a fraction of the computational budget. Moreover, our approach exhibits superior robustness at very low rates, where conventional KBs suffer from catastrophic failure. Our work resolves a fundamental limitation of VQ-VAE-based semantic communication systems, offering a practical and efficient path toward flexible and rate-adaptive semantic communication.