mlsanityData to 14 Oct 2026

Complex-Valued Phase-Coherent Transformer

arXiv 2605.10123 ↗First posted 11 May 2026cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Complex-valued Transformers have largely inherited softmax attention from real-valued architectures. However, row-normalised token competition is not necessarily aligned with phase-preserving computation. In this paper, we introduce the Phase-Coherent Transformer (PCT), which applies a real-valued, element-independent, smooth gate to L2-normalised complex query-key similarities. PCT replaces token competition with token-non-competing attention and is designed to preserve phase information across layers. Across mid-scale benchmarks spanning long-range memory, hierarchical long-range reasoning, positional retrieval, phase-based memory and superposition, and image classification, PCT shows strong generalisation across task categories. Under parameter-fair comparison, PCT consistently outperforms both the standard softmax Transformer and its direct complex-valued counterpart. Moreover, even on tasks traditionally considered difficult for complex-valued neural networks, such as NIAH and LRA-Text, PCT remains competitive with Multiscreen, the strongest real-valued NN baseline in our comparison. Experiments introducing gates that deliberately violate the PCT conditions show that the design is not incidental: smooth gates that preserve negatively aligned phase components remain strong, whereas gates that delete such components collapse on long-range retrieval, and gates whose outputs become excessively large suffer clear performance degradation. PCT also shows no depth-related accuracy collapse across the tested depth range. These results support introducing multi-layer phase-coherent structure into attention as a promising design principle for achieving generalisation in complex-valued Transformers.

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

Builds on

0 of 18 references.

No references here yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2026Keyless Attention: Value-Space Routing and Value-Only Caching for Efficient Transformers
  2. 2025Value-State Gated Attention for Mitigating Extreme-Token Phenomena in Transformers
  3. 2026The Expressive Power of Low Precision Softmax Transformers with (Summarized) Chain-of-Thought
  4. 2026State Propagation Also Satisfies: A Complex-Valued State-Space Model for Deterministic State Tracking
  5. 2026Pretraining Transformers with Quantized Softmax in Attention
  6. 2026Training Trajectories Determine Circuit Removability in Annealable Soft-Prior Transformers
  7. 2023Gated Linear Attention Transformers with Hardware-Efficient Training
  8. 2026Bridging KV-Cache Quantization and Linear Attention: From Theory to Pretrained Weight Migration