Leveraging Binary Hashing for Scalable Index Assignment in Semantic Communications

Leonardo Roque, Kuangyun Zhu, Louis-Adrien Dufrène, Quentin Lampin, Grégoire Lefebvre, Mohamad AssaadarXiv 2026 · arXiv

TL;DR

This paper proposes using binary hashing techniques from information retrieval as a scalable, low-complexity alternative to traditional vector quantization for semantic communications. By mapping high-dimensional sentence embeddings to compact binary codes, the authors demonstrate that task-oriented methods like CCA-ITQ can achieve superior classification accuracy and remarkable robustness to channel noise while significantly reducing transmitter complexity.

What Problem Does This Paper Address?

In the emerging field of semantic communications, the goal is to transmit the "meaning" of data rather than just raw bits. For text, this usually involves sending high-dimensional embedding vectors. However, transmitting these raw vectors (e.g., 768-dimensional floats) is prohibitively expensive, requiring over 24,000 bits per sentence.

Standard compression relies on Vector Quantization (VQ), which maps vectors to a finite "codebook." This approach faces three major hurdles:

  1. Scalability: Finding the nearest neighbor in a large codebook is computationally expensive for the transmitter.
  2. The Index Assignment Problem (IAP): Assigning binary codes to codebook entries such that bit errors don't lead to massive semantic distortion is an NP-hard problem.
  3. Rigidity: VQ introduces an irreducible distortion based on the fixed codebook size.

The authors look to solve these by replacing VQ with binary hashing, shifting the complexity from the transmitter to the receiver and providing a more flexible way to scale bitrates.

Methods

The authors evaluate a pipeline where a sentence is converted into an embedding, hashed into a $b$-bit binary code, sent over a noisy Binary Symmetric Channel (BSC), and then reconstructed at the receiver using a shared lookup table.

Fig. 1: Studied semantic communication system. The input sentence x is mapped to an embedding e, encoded into a binary code c, transmitted over a BSC, and reconstructed from a shared table before downstream classification. The Classifier block implements a logistic regression model with a softmax output layer over 77 banking intent classes (Banking77 dataset).

They compare several hashing strategies:

  • Locality-Sensitive Hashing (LSH): Uses random hyperplanes to partition the space. It’s fast but data-independent.
  • PCA-based Hashing: Uses Principal Component Analysis to align hyperplanes with the directions of maximum variance in the data.
  • CCA-based Hashing: A "task-oriented" approach using Canonical Correlation Analysis to find projections that maximize the correlation between embeddings and their class labels.
  • Iterative Quantization (ITQ): A refinement step applied to PCA or CCA that rotates the projection to minimize quantization error and balance bit assignments.

At the receiver, instead of a fixed codebook, they use Hamming Retrieval: the received noisy code is matched to the closest previously seen code in a shared database of training samples.

Datasets

The study uses the Banking77 dataset, which contains 10,003 training samples and 3,080 test samples across 77 banking-related intent classes. Embeddings are generated using the mpnet-base-nli model (768 dimensions). Evaluation follows the Massive Text Embedding Benchmark (MTEB) protocol, using a logistic regression classifier on the reconstructed embeddings.

Key Insights and Ideas

  • Task-Awareness Trumps Reconstruction: One of the most important findings is that low Mean Squared Error (MSE) does not always mean better performance. CCA-ITQ actually had higher reconstruction error than some baselines but achieved the highest classification accuracy. This highlights the core philosophy of semantic communications: preserve the information that matters for the task, not the raw signal.
  • ITQ is a Robustness Multiplier: The Iterative Quantization (ITQ) step significantly improves performance under noisy channel conditions. By balancing the bits, it ensures that a single bit flip is less likely to jump the vector into a completely different semantic region.
  • Complexity Flip: Hashing moves the heavy lifting. While VQ requires the transmitter to perform an exhaustive search ($O(Kd)$), hashing only requires a simple matrix projection ($O(bd)$). This makes hashing ideal for power-constrained IoT devices or mobile transmitters.

Key Results

The experiments show that data-dependent hashing consistently outperforms random LSH and traditional VQ baselines at higher bitrates.

  • Efficiency: Using only 128 bits (a 192x compression factor), CCA-ITQ achieved a classification accuracy of 83.3%, which actually surpassed the uncompressed IEEE 754 floating-point baseline under noisy conditions.
  • Noise Robustness: In high-noise scenarios (10% bit error rate), traditional VQ (K-means + BSA) performance collapsed to ~35%, while CCA-ITQ maintained a remarkable 82.3% accuracy.
  • Scalability: As shown in the accuracy vs. bits plots, hashing methods continue to improve as more bits are added, whereas VQ-based methods like K-means hit a "practical ceiling" due to the exponential growth of codebook optimization complexity.
Accuracy vs Transmitted Bits across different noise levels

Limitations and Future Work

  • Database Size: The receiver needs to store a "shared table" of training samples. While this avoids runtime signaling, the memory requirement scales with the size of the training set ($N$).
  • Search Complexity: While the transmitter is simplified, the receiver must perform a Hamming distance search over $N$ entries. For massive datasets, this might require approximate nearest neighbor search techniques.
  • Scope: The paper focuses on a single text classification task. The authors note that future work should explore multi-task scenarios, larger datasets, and other modalities like images or multimodal embeddings.

Summary updated

Abstract

Transmitting semantically structured embedding vectors over digital channels is costly in bit rate, while conven- tional vector quantization approaches face limitations in scalabil- ity, encoding complexity, and index assignment. This paper inves- tigates binary hashing techniques from the information retrieval literature as semantic indexing strategies for general-purpose networks. We study random Locality-Sensitive Hashing (LSH) along with Principal Component Analysis (PCA)-, Canonical Correlation Analysis (CCA)-, and ITQ (Iterative Quantization)- based variants in a semantic communication pipeline over a Binary Symmetric Channel. Embeddings are compressed into binary codes, reconstructed through Hamming retrieval from a shared table, and evaluated on downstream classification. Ex- periments on the Massive Text Embedding Benchmark (MTEB) and the Banking77 dataset show that data-dependent hashing improves upon random LSH, while ITQ refinement increases robustness to channel noise. Among the evaluated methods, CCA- ITQ achieves the best classification accuracy across the tested channel conditions. These results indicate that binary hashing is an efficient and scalable alternative to quantization-based embedding compression for semantic communications.
BibTeX
@misc{roque2026leveraging,
  author = {Leonardo Roque and Kuangyun Zhu and Louis-Adrien Dufrène and Quentin Lampin and Grégoire Lefebvre and Mohamad Assaad},
  title = {{Leveraging Binary Hashing for Scalable Index Assignment in Semantic Communications}},
  year = {2026},
  eprint = {2611.21260},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.21260},
}
Figure