Tensorizing Engram: Sharing Latents Across N-Gram Embeddings is Beneficial in LLMs
Not on the map. Why?
Abstract (arXiv)
Modern language models represent text using discrete token-level embeddings, which forces recurring multi-token patterns to be learned implicitly across Transformer layers. Both Over-tokenized Transformers and Engram attempt to address this limitation by explicitly incorporating multi-token (n-gram) memories. However, they rely on separate hash tables for each n-gram order, which introduces hash collisions and prevents nested n-grams from sharing the underlying latent structures. To address these issues, we propose Tensorized Engram (TN-gram), a compact memory module that represents tensorized n-gram embeddings through shared factors in the Canonical Polyadic (CP) form. TN-gram learns shared token-position factors together with order-absorption vectors to encode the embeddings of different n-gram order. Comprehensive experiments demonstrate that TN-gram matches or even outperforms Engram-style n-gram modules while requiring much fewer parameters.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 35 of its 49 references that are in the map. First posted on arXiv 6 Jun 2026.
Builds on
35 of 49 references.
References · 35
- 2017Attention Is All You Needcited by 59,932
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2023GPT-4 Technical Reportcited by 18,132
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
23 more
- 2022Beyond the Imitation Game: Quantifying and extrapolating the capabilities of language modelscited by 1,970
- 2018CommonsenseQA: A Question Answering Challenge Targeting Commonsense Knowledgecited by 1,793
- 2016Enriching Word Vectors with Subword Informationcited by 1,578
- 2024The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scalecited by 1,104
- 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 960
- 2023AGIEval: A Human-Centric Benchmark for Evaluating Foundation Modelscited by 701
- 2018CoQA: A Conversational Question Answering Challengecited by 674
- 2022Mixture-of-Experts with Expert Choice Routingcited by 611
- 2024DataComp-LM: In search of the next generation of training sets for language modelscited by 381
- 2015Tensorizing Neural Networkscited by 246
- 2024Byte Latent Transformer: Patches Scale Better Than Tokenscited by 137
- 2026Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Modelscited by 78
- 2017Hash Embeddings for Efficient Word Representationscited by 54
- 2025Over-Tokenized Transformer: Vocabulary is Generally Worth Scalingcited by 42
- 2024Understanding Transformers via N-gram Statisticscited by 23
- 2025Scaling Embedding Layers in Language Modelscited by 19
- 2023TensorGPT: Efficient Compression of Large Language Models based on Tensor-Train Decompositioncited by 15
- 2026Scaling Embeddings Outperforms Scaling Experts in Language Modelscited by 13
- 2025TensorLLM: Tensorising Multi-Head Attention for Enhanced Reasoning and Compression in LLMscited by 11
- 2026KromHC: Manifold-Constrained Hyper-Connections with Kronecker-Product Residual Matricescited by 10
- 2024Faster Language Models with Better Multi-Token Prediction Using Tensor Decompositioncited by 7
- 2025Domain-Aware Tensor Network Structure Searchcited by 5
- 2025Understanding the Rank of Tensor Networks via an Intuitive Example-Driven Approachcited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.