Evolving Token Communication with Parametric Memory Network

• URL: http://arxiv.org/abs/2605.01869v1
• Date: Sun, 03 May 2026 13:29:36 GMT
• Title: Evolving Token Communication with Parametric Memory Network
• Abstract summary: We propose an evolving semantic token communication system with a parametric memory network.<n>Only an equal-length prefix of each semantic token is transmitted, which reduces transmission cost.<n> Experimental results demonstrate that the proposed method consistently outperforms the existing evolving memory benchmark.
• Score: 4.436062422228445
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Token communication has emerged as a promising framework for efficient wireless transmission by representing source data as compact semantic tokens. However, transmitting full semantic tokens still incurs considerable communication overhead. In this paper, we propose an evolving semantic token communication system with a parametric memory network over MIMO fading channels. Specifically, only an equal-length prefix of each semantic token is transmitted, which reduces transmission cost while preserving a consistent token structure for receiver-side recovery. At the receiver, a parametric memory network is introduced to reconstruct the missing suffix information from the received token prefixes, where semantic memory is stored implicitly in the network parameters. To realize this design, full semantic tokens are first organized into a codebook, and truncated tokens are paired with the codeword labels of their corresponding full tokens. Based on these token-label pairs, kNN-based teacher distributions are constructed to fine-tune a pretrained GPT-2-based recovery module, which learns to infer the codeword distribution of each incomplete token and recover the corresponding complete semantic token. In addition, an online evolution strategy is developed to periodically update the parametric memory network and the entire system using newly observed test samples, thereby improving adaptability under distribution shifts. Experimental results demonstrate that the proposed method consistently outperforms the existing evolving memory benchmark under different channel conditions and channel bandwidth ratios, with up to 1.09 dB PSNR improvement.

Related papers

• Ada-TokenCom: Rate-Adaptive Token Communications via Large-Model-Driven Token Compression and Generation [52.99258064220833]
  Ada-TokenCom is a rate-adaptive TokenCom framework based on large autoregressive models.<n>We propose a mixed reconstruction/generation scheme, where the transmitter encodes and transmits the highly informative tokens.<n>We show that our proposed Ada-TokenCom framework outperforms both digital and deep joint source-channel coding-based semantic communication baselines.
  arXiv  Detail & Related papers  (2026-08-28T08:54:28Z)
• Latent Recurrent Transformer: Architecture Exploration, Training Strategies, and Scaling Behavior [107.2098567818173]
  Latent Recurrent Transformer (LRT) is a lightweight augmentation of autoregressive transformers.<n>LRT reuses a high-level source-layer hidden state from the previous token as recurrent memory for the next token.
  arXiv  Detail & Related papers  (2026-05-26T10:10:26Z)
• TONIC: Token-Centric Semantic Communication for Task-Oriented Wireless Systems [14.091462200232835]
  TONIC is a token-centric semantic communication framework for task-oriented wireless systems.<n>Our framework combines transmitter-side semantic-aware protection with receiver-side confidence-aware gating.
  arXiv  Detail & Related papers  (2026-05-20T11:49:11Z)
• On the Semantic and Syntactic Information Encoded in Proto-Tokens for One-Step Text Reconstruction [0.5097809301149341]
  Autoregressive large language models (LLMs) generate text token-by-token, requiring n forward passes to produce a sequence of length n.<n>Recent work shows that frozen LLMs can reconstruct hundreds of tokens from only two learned proto-tokens in a single forward pass.<n>We study what information these proto-tokens encode and how they behave under reconstruction and controlled constraints.
  arXiv  Detail & Related papers  (2026-02-20T15:54:10Z)
• Wireless TokenCom: RL-Based Tokenizer Agreement for Multi-User Wireless Token Communications [59.84545048095092]
  Token Communications (TokenCom) has recently emerged as an effective new paradigm, where tokens are the unified units of communications computations.<n>We investigate a multi-user downlink wireless TokenCom scenario, where the base station transmits multiple users.
  arXiv  Detail & Related papers  (2026-02-12T19:00:33Z)
• MergeDNA: Context-aware Genome Modeling with Dynamic Tokenization through Token Merging [65.07273789940116]
  This paper introduces a hierarchical architecture that jointly optimize a dynamic genomic tokenizer and latent Transformers with context-aware pre-training tasks.<n> MergeDNA achieves superior performance on three popular DNA benchmarks and several multi-omics tasks with fine-tuning or zero-shot evaluation.
  arXiv  Detail & Related papers  (2025-11-17T19:27:41Z)
• Training-Free Tokenizer Transplantation via Orthogonal Matching Pursuit [45.18582668677648]
  We present a training-free method to transplant tokenizers in large language models.<n>We approximate each out-of-vocabulary token as a sparse linear combination of shared tokens.<n>We show that OMP achieves best zero-shot preservation of the base model's performance.
  arXiv  Detail & Related papers  (2025-06-07T00:51:27Z)
• SEP: Self-Enhanced Prompt Tuning for Visual-Language Model [93.94454894142413]
  We introduce a novel approach named Self-Enhanced Prompt Tuning (SEP) SEP explicitly incorporates discriminative prior knowledge to enhance both textual-level and visual-level embeddings. Comprehensive evaluations across various benchmarks and tasks confirm SEP's efficacy in prompt tuning.
  arXiv  Detail & Related papers  (2024-05-24T13:35:56Z)
• Reasoning with the Theory of Mind for Pragmatic Semantic Communication [62.87895431431273]
  A pragmatic semantic communication framework is proposed in this paper. It enables effective goal-oriented information sharing between two-intelligent agents. Numerical evaluations demonstrate the framework's ability to achieve efficient communication with a reduced amount of bits.
  arXiv  Detail & Related papers  (2023-11-30T03:36:19Z)
• Transformer-based Joint Source Channel Coding for Textual Semantic Communication [23.431590618978948]
  Space-Air-Ground-Sea integrated network calls for more robust and secure transmission techniques against jamming. We propose a textual semantic transmission framework for robust transmission, which utilizes the advanced natural language processing techniques to model and encode sentences.
  arXiv  Detail & Related papers  (2023-07-23T08:42:05Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.