Saved in:
Bibliographic Details
Main Authors: Zheng, Yunao, Xia, Guoyang, Wang, Xiaojie, Ren, Lei
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2605.24869
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913159622688768
author Zheng, Yunao
Xia, Guoyang
Wang, Xiaojie
Ren, Lei
author_facet Zheng, Yunao
Xia, Guoyang
Wang, Xiaojie
Ren, Lei
contents Sequence modeling requires both compositional reasoning and local static knowledge retrieval, yet standard Transformers handle both through dense computation. Engram partially decouples retrieval from the backbone, but its token-based keys remain tied to text tokenization and hash compression. We propose Lngram, a latent-space conditional memory module that learns discrete symbols directly from hidden states and performs N-gram lookup over these symbols. This design removes the dependence on tokenizer IDs and naturally extends to non-text modalities. In our evaluated settings, Lngram outperforms Transformer and Engram baselines, consistently reduces perplexity in long-context language modeling, and effectively injects domain knowledge when added post hoc to pretrained models. Joint training with the backbone further surpasses full fine-tuning, while experiments on vision-language and vision-language-action tasks show overall gains. Analyses with LogitLens and CKA suggest that Lngram enables prediction-relevant information to emerge earlier, increasing effective depth with limited inference and memory overhead. Code is available at https://github.com/zyaaa-ux/Lngram.
format Preprint
id arxiv_https___arxiv_org_abs_2605_24869
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Lngram: N-gram Conditional Memory in Latent Space
Zheng, Yunao
Xia, Guoyang
Wang, Xiaojie
Ren, Lei
Computation and Language
Sequence modeling requires both compositional reasoning and local static knowledge retrieval, yet standard Transformers handle both through dense computation. Engram partially decouples retrieval from the backbone, but its token-based keys remain tied to text tokenization and hash compression. We propose Lngram, a latent-space conditional memory module that learns discrete symbols directly from hidden states and performs N-gram lookup over these symbols. This design removes the dependence on tokenizer IDs and naturally extends to non-text modalities. In our evaluated settings, Lngram outperforms Transformer and Engram baselines, consistently reduces perplexity in long-context language modeling, and effectively injects domain knowledge when added post hoc to pretrained models. Joint training with the backbone further surpasses full fine-tuning, while experiments on vision-language and vision-language-action tasks show overall gains. Analyses with LogitLens and CKA suggest that Lngram enables prediction-relevant information to emerge earlier, increasing effective depth with limited inference and memory overhead. Code is available at https://github.com/zyaaa-ux/Lngram.
title Lngram: N-gram Conditional Memory in Latent Space
topic Computation and Language
url https://arxiv.org/abs/2605.24869