mlsanityData to 7 Oct 2026

Beyond N-gram: Data-Aware X-GRAM Extraction for Efficient Embedding Parameter Scaling

arXiv 2604.21724 ↗First posted 23 Apr 2026cs.CLcited by 1

Not on the map. Why?

Abstract (arXiv)

Large token-indexed lookup tables provide a compute-decoupled scaling path, but their practical gains are often limited by poor parameter efficiency and rapid memory growth. We attribute these limitations to Zipfian under-training of the long tail, heterogeneous demand across layers, and "slot collapse" that produces redundant embeddings. To address this, we propose X-GRAM, a frequency-aware dynamic token-injection framework. X-GRAM employs hybrid hashing and alias mixing to compress the tail while preserving head capacity, and refines retrieved vectors via normalized SwiGLU ShortConv to extract diverse local n-gram features. These signals are integrated into attention value streams and inter-layer residuals using depth-aware gating, effectively aligning static memory with dynamic context. This design introduces a memory-centric scaling axis that decouples model capacity from FLOPs. Extensive evaluations at the 0.73B and 1.15B scales show that X-GRAM improves average accuracy by as much as 4.4 points over the vanilla backbone and 3.2 points over strong retrieval baselines, while using substantially smaller tables in the 50% configuration. Overall, by decoupling capacity from compute through efficient memory management, X-GRAM offers a scalable and practical paradigm for future memory-augmented architectures. Code aviliable in https://github.com/Longyichen/X-gram.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 19 of its 25 references that are in the map. First posted on arXiv 23 Apr 2026.

Builds on

19 of 25 references.

References · 19

  1. 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
  2. 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
  3. 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,601
  4. 2020On Layer Normalization in the Transformer Architecturecited by 906
  5. 2022Mixture-of-Experts with Expert Choice Routingcited by 611
  6. 2019Deep Learning Recommendation Model for Personalization and Recommendation Systemscited by 327
  7. 2021BASE Layers: Simplifying Training of Large, Sparse Modelscited by 315
  8. 2023From Sparse to Soft Mixtures of Expertscited by 245
  9. 2021Hash Layers For Large Sparse Modelscited by 236
  10. 2018Adaptive Input Representations for Neural Language Modelingcited by 226
  11. 2024Scaling Laws for Fine-Grained Mixture of Expertscited by 166
  12. 2026Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Modelscited by 78
7 more
  1. 2019Compositional Embeddings Using Complementary Partitions for Memory-Efficient Recommendation Systemscited by 68
  2. 2017Hash Embeddings for Efficient Word Representationscited by 54
  3. 2025Over-Tokenized Transformer: Vocabulary is Generally Worth Scalingcited by 42
  4. 2019Mixed Dimension Embeddings with Application to Memory-Efficient Recommendation Systemscited by 41
  5. 2025Scaling Embedding Layers in Language Modelscited by 19
  6. 2026STEM: Scaling Transformers with Embedding Modulescited by 10
  7. 2023In defense of parameter sharing for model-compressioncited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.