mlsanityData to 7 Oct 2026

Phase-Associative Memory: Sequence Modeling in Complex Hilbert Space

arXiv 2604.05030 ↗First posted 6 Apr 2026cs.CL cs.AI cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Experiments probing natural language processing by both humans and LLMs suggest that the meaning of a semantic expression is indeterminate prior to the act of interpretation rather than being specifiable simply as the sum of its parts (i.e. compositionality). This observer-dependent act dynamically actualizes meaning under genuine contextuality more consistent with quantum logical mechanisms than with classical Boolean approaches that assume separability, motivating an approach to language modeling that utilizes a Hilbert space formalism. In this work, we introduce Phase-Associative Memory (PAM) -- a complex-valued sequence model whose state St ∈ mathbbCd × d accumulates outer products of complex token embeddings retrieved through the conjugate inner product Relangle K mid Qrangle / √d -- and evaluate it against a structurally matched real-valued ablation. Both architectures train stably across a 5M--100M parameter sweep on WikiText-103 under identical conditions; PAM sits at higher absolute loss at every measured scale but improves more rapidly with parameter count, with power-law exponents of -0.15 vs. -0.12 in loss and -0.65 vs. -0.49 in perplexity that narrow the gap between the two architectures monotonically. Further investigation of complex-valued sequence modeling at larger scales could reveal that the loss plateau characteristic of real-valued state-of-the-art language models (e.g. transformers) is reachable with PAM-style architectures with an order of magnitude fewer parameters than the current frontier (~1T), implying that similar capabilities are achievable at sizes runnable on consumer-grade hardware.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 45 of its 113 references that are in the map. First posted on arXiv 6 Apr 2026.

Builds on

45 of 113 references.

References · 45

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2020Language Models are Few-Shot Learnerscited by 32,199
  3. 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Taskscited by 9,160
  4. 2020Scaling Laws for Neural Language Modelscited by 6,411
  5. 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,616
  6. 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,581
  7. 2014Neural Machine Translation by Jointly Learning to Align and Translatecited by 4,530
  8. 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,346
  9. 2016Pointer Sentinel Mixture Modelscited by 2,992
  10. 2022Training Compute-Optimal Large Language Modelscited by 2,927
  11. 2022Survey of Hallucination in Natural Language Generationcited by 2,056
  12. 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 1,979
33 more
  1. 2024Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameterscited by 1,928
  2. 2023A Survey on Hallucination in Large Language Models: Principles, Taxonomy, Challenges, and Open Questionscited by 1,582
  3. 2023Not what you've signed up for: Compromising Real-World LLM-Integrated Applications with Indirect Prompt Injectioncited by 1,339
  4. 2024Transformers are SSMs: Generalized Models and Efficient Algorithms Through Structured State Space Dualitycited by 1,283
  5. 2023RWKV: Reinventing RNNs for the Transformer Eracited by 814
  6. 2022Ignore Previous Prompt: Attack Techniques For Language Modelscited by 760
  7. 2023Retentive Network: A Successor to Transformer for Large Language Modelscited by 594
  8. 2024Scaling and evaluating sparse autoencoderscited by 530
  9. 2023Gated Linear Attention Transformers with Hardware-Efficient Trainingcited by 490
  10. 2021Linear Transformers Are Secretly Fast Weight Programmerscited by 471
  11. 2020Hopfield Networks is All You Needcited by 461
  12. 2023Resurrecting Recurrent Neural Networks for Long Sequencescited by 397
  13. 2024Parallelizing Linear Transformers with the Delta Rule over Sequence Lengthcited by 373
  14. 2024xLSTM: Extended Long Short-Term Memorycited by 320
  15. 2015Unitary Evolution Recurrent Neural Networkscited by 291
  16. 2024Griffin: Mixing Gated Linear Recurrences with Local Attention for Efficient Language Modelscited by 232
  17. 2016Dense Associative Memory for Pattern Recognitioncited by 230
  18. 2017Deep Complex Networkscited by 215
  19. 2024Simple linear attention language models balance the recall-throughput tradeoffcited by 197
  20. 2025Open Problems in Mechanistic Interpretabilitycited by 173
  21. 2024Eagle and Finch: RWKV with Matrix-Valued States and Dynamic Recurrencecited by 155
  22. 2021A Survey on Hyperdimensional Computing aka Vector Symbolic Architectures, Part I: Models and Data Transformationscited by 98
  23. 2016Full-Capacity Unitary Recurrent Neural Networkscited by 90
  24. 2023GateLoop: Fully Data-Controlled Linear Recurrence for Sequence Modelingcited by 45
  25. 2016Associative Long Short-Term Memorycited by 37
  26. 2024On the Complexity of Neural Computation in Superpositioncited by 21
  27. 2018Complex Gated Recurrent Neural Networkscited by 17
  28. 2025On the Limits of Sparse Autoencoders: A Theoretical Framework and Reweighted Remedycited by 12
  29. 2025A quantum semantic framework for natural language processingcited by 5
  30. 2025From Isolation to Entanglement: When Do Interpretability Methods Identify and Disentangle Known Concepts?cited by 5
  31. 2024Quantum-Like Contextuality in Large Language Modelscited by 4
  32. 2026Artificial Entanglement in the Fine-Tuning of Large Language Modelscited by 1
  33. 2026The production of meaning in the processing of natural languagecited by 1

Built on by

Not cited yet.