OrBIT: Structure-Guided Embedding Compression
Not on the map. Why?
Abstract (arXiv)
Embedding tables are among the largest components of modern language models. Most compression methods fix a coding geometry such as coordinate blocks, low-rank subspaces, or unrestricted codebooks, and optimize within it. We instead ask whether the coding geometry can itself be discovered. We introduce OrBIT, a structure-guided embedding compression framework that learns reusable local geometry from orbit dynamics and uses it to constrain a small set of shared codewords. The global reconstruction residual then decides where the fixed coding budget is spent, while redundant overlapping charts let local errors compensate one another after gluing. Our theory shows how tight-chart geometry controls distortion, how the global residual directs sequential allocation, and how data-geometry-guided refinement improves the codec. The resulting orbit machinery is compiled away, leaving a compact decoder in which the learned structure governs what is stored, where capacity is allocated, and how local information is assembled globally. Across four LLM embedding tables, OrBIT achieves 37.9× compression on GPT-2 and over 23× on each 7B table relative to 16-bit storage, while delivering competitive rate-distortion performance against established quantization and low-rank baselines.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 1 of its 17 references that are in the map. First posted on arXiv 7 Oct 2026.
Builds on
1 of 17 references.
References · 1
- 2014Stacked Quantizers for Compositional Vector Compressioncited by 30
Built on by
Not cited yet.