ADE: Adaptive Dictionary Embeddings -- Scaling Multi-Anchor Representations to Large Language Models
Not on the map. Why?
Abstract (arXiv)
Word embeddings are fundamental to natural language processing, yet traditional approaches represent each word with a single vector, creating representational bottlenecks for polysemous words and limiting semantic expressiveness. While multi-anchor representations have shown promise by representing words as combinations of multiple vectors, they have been limited to small-scale models due to computational inefficiency and lack of integration with modern transformer architectures. We introduce Adaptive Dictionary Embeddings (ADE), a framework that successfully scales multi-anchor word representations to large language models. ADE makes three key contributions: (1) Vocabulary Projection (VP), which transforms the costly two-stage anchor lookup into a single efficient matrix operation; (2) Grouped Positional Encoding (GPE), a novel positional encoding scheme where anchors of the same word share positional information, preserving semantic coherence while enabling anchor-level variation; and (3) context-aware anchor reweighting, which leverages self-attention to dynamically compose anchor contributions based on sequence context. We integrate these components into the Segment-Aware Transformer (SAT), which provides context-aware reweighting of anchor contributions at inference time. We evaluate ADE on AG News and DBpedia-14 text classification benchmarks. With 98.7% fewer trainable parameters than DeBERTa-v3-base, ADE surpasses DeBERTa on DBpedia-14 (98.06% vs. 97.80%) and approaches it on AG News (90.64% vs. 94.50%), while compressing the embedding layer over 40x -- demonstrating that multi-anchor representations are a practical and parameter-efficient alternative to single-vector embeddings in modern transformer architectures.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 21 of its 26 references that are in the map. First posted on arXiv 27 Apr 2026.
Builds on
21 of 26 references.
References · 21
- 2017Attention Is All You Needcited by 60,361
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,703
- 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,375
- 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,307
- 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,790
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
- 2018Deep contextualized word representationscited by 2,290
- 2020DeBERTa: Decoding-enhanced BERT with Disentangled Attentioncited by 2,181
- 2021DeBERTaV3: Improving DeBERTa using ELECTRA-Style Pre-Training with Gradient-Disentangled Embedding Sharingcited by 1,254
- 2018Self-Attention with Relative Position Representationscited by 1,120
- 2021Train Short, Test Long: Attention with Linear Biases Enables Input Length Extrapolationcited by 1,103
9 more
- 2024Smarter, Better, Faster, Longer: A Modern Bidirectional Encoder for Fast, Memory Efficient, and Long Context Finetuning and Inferencecited by 554
- 2021ByT5: Towards a token-free future with pre-trained byte-to-byte modelscited by 509
- 2021CANINE: Pre-training an Efficient Tokenization-Free Encoder for Language Representationcited by 232
- 2021Charformer: Fast Character Transformers via Gradient-based Subword Tokenizationcited by 160
- 2015Compressing Neural Networks with the Hashing Trickcited by 150
- 2017Compressing Word Embeddings via Deep Compositional Code Learningcited by 35
- 2024Embedding Compression in Recommender Systems: A Surveycited by 14
- 2018Compositional Coding Capsule Network with K-Means Routing for Text Classificationcited by 5
- 2025CARVQ: Corrective Adaptor with Group Residual Vector Quantization for LLM Embedding Compressioncited by 3
Built on by
Not cited yet.