arXiv (All)
open access
Latest Exact Match Attention
We introduce latest exact match attention (LEMA), an attention variant for transformers where queries and keys are binarized and each query attends only to the latest exactly matching key. We prove that LEMA transformers with chain of thought can simulate word-RAMs, as was recently shown for the les
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On the Recall Scaling Laws in Mamba: A Theoretical and Mechanistic Study via Hashing#984587
- Invertible Query-Key Coupling Composes with Attention Mechanisms#1076847
- Query Expansion and Key Specialization in Transformer Attention Geometry#1119346
- The Inverse Lyndon Array#1049142
- Shift-Accumulate Attention: Multiplier-Free Query--Key Products for Transformer Decoding#986979
Record · ID 1061432
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive