← 研踪 PaperTrailarXiv:2611.21238 · v1
Recursive Spectral Graph Partitioning Coding for Index Assignment in Semantic Communications
首次提交 2026-11-16 23:23
版本更新 2026-11-16 23:23
雷达观测 2026-11-17 16:10
摘要
Transmitting quantized semantic embeddings over a bit-flip channel requires a binary mapping that minimizes expected reconstruction distortion. The classical Binary Switching Algorithm (BSA) ( for centroids) yields locally optimal assignments but ignores hierarchical bit significance, making it incompatible with Unequal Error Protection (UEP). We propose Recursive Spectral Graph Partitioning (RSGP), which recursively bisects the centroid affinity graph along the Fiedler eigenvector so that early bits separate semantically distant groups while later bits refine local structure. RSGP runs in with no iterative outer loop, and is the only method studied to show a systematic positive UEP gain: protecting early bits over later ones improves accuracy for RSGP, while being neutral or harmful for unstructured assignments. Experiments on the Banking77 dataset and the Massive Text Embedding Benchmark (MTEB) confirm that RSGP consistently matches or exceeds BSA accuracy across codebook sizes and error profiles.
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-16 23:23 · 最新观测版本
Recursive Spectral Graph Partitioning Coding for Index Assignment in Semantic Communications
Transmitting quantized semantic embeddings over a bit-flip channel requires a binary mapping that minimizes expected reconstruction distortion. The classical Binary Switching Algorithm (BSA) ( for centroids) yields locally optimal assignments but ignores hierarchical bit significance, making it incompatible with Unequal Error Protection (UEP). We propose Recursive Spectral Graph Partitioning (RSGP), which recursively bisects the centroid affinity graph along the Fiedler eigenvector so that early bits separate semantically distant groups while later bits refine local structure. RSGP runs in with no iterative outer loop, and is the only method studied to show a systematic positive UEP gain: protecting early bits over later ones improves accuracy for RSGP, while being neutral or harmful for unstructured assignments. Experiments on the Banking77 dataset and the Massive Text Embedding Benchmark (MTEB) confirm that RSGP consistently matches or exceeds BSA accuracy across codebook sizes and error profiles.
查看此版本解读 →查看此版本原文 ↗