mlsanityData to 14 Oct 2026

SymbolicLight V1: Spike-Gated Dual-Path Language Modeling at High Encoder Spike Sparsity

arXiv 2605.21333 ↗First posted 20 May 2026cs.CL cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Natively trained spiking language models must preserve information across time while operating through sparse binary activations, a combination that has produced a persistent quality gap relative to dense Transformers. We present SymbolicLight V1, a spike-gated dual-path language model that couples binary Leaky Integrate-and-Fire (LIF) dynamics with a continuous residual stream. Its Dual-Path SparseTCAM mixer combines a first-order exponential-decay state with windowed local attention on the continuous residual stream, followed by a context-conditioned decoding head. We train four 194M-parameter models from scratch on a 3B-token, 10-domain Chinese-English corpus. On a fixed token-weighted evaluation set the runs reach perplexity (PPL) 8.88-8.93 (mean 8.904, sample standard deviation 0.019). Separation of this set from the training streams has not been verified. Training-time encoder probes have a mean zero-spike fraction of 89.96%; this is not a whole-model sparsity measure. Code tokens are 43.7% of that set; the unweighted mean of the ten domain PPLs is 29.38. Under the same corpus, tokenizer, token budget, and hardware, the token-weighted mean is 7.7% above GPT-2 201M (PPL 8.27). Across five zero-shot benchmarks the two 200M-scale models show no clear accuracy separation. Under sampling with temperature 0.7 and top-k 50, SymbolicLight produces lower 4-gram repetition; an entropy-modulated rule reverses that ranking. On an RTX 2080 Ti, measured generation throughput is 22.8 versus 91.5 token/s; post-generation power readings give rough energy estimates of 2,848 versus 905 mJ/token, without power integration over generation.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 22 of its 31 references that are in the map. First posted on arXiv 20 May 2026.

Builds on

22 of 31 references.

References · 22

  1. 2017Attention Is All You Needcited by 60,361
  2. 2015Distilling the Knowledge in a Neural Networkcited by 10,324
  3. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  4. 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,718
  5. 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,703
  6. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  7. 2020Longformer: The Long-Document Transformercited by 3,413
  8. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
  9. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  10. 2018SentencePiece: A simple and language independent subword tokenizer and detokenizer for Neural Text Processingcited by 1,989
  11. 2020Big Bird: Transformers for Longer Sequencescited by 1,684
  12. 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 992
10 more
  1. 2023RWKV: Reinventing RNNs for the Transformer Eracited by 827
  2. 2017Crowdsourcing Multiple Choice Science Questionscited by 765
  3. 2019Surrogate Gradient Learning in Spiking Neural Networkscited by 626
  4. 2023Retentive Network: A Successor to Transformer for Large Language Modelscited by 613
  5. 2023Gated Linear Attention Transformers with Hardware-Efficient Trainingcited by 514
  6. 2020DeeBERT: Dynamic Early Exiting for Accelerating BERT Inferencecited by 332
  7. 2022Confident Adaptive Language Modelingcited by 310
  8. 2024The Era of 1-bit LLMs: All Large Language Models are in 1.58 Bitscited by 308
  9. 2023SpikeGPT: Generative Pre-trained Language Model with Spiking Neural Networkscited by 88
  10. 2024SpikeLLM: Scaling up Spiking Neural Network to Large Language Models via Saliency-based Spikingcited by 31

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.