about
Attention Is Not What You Need: Grassmann Flows as an Attention-Free Alternative (arxiv.org)
3 points by lexandstuff 281 days ago | hide | past | pdf | discuss on HN

In plain words: Instead of comparing every token with every other through an attention matrix, this design turns token pairs into geometric shapes and mixes them into word states. It trailed same-size Transformers on language modeling by 10 to 15 percent but slightly beat one on sentence reasoning.

Abstract · Attention Is Not What You Need

We revisit a basic question in sequence modeling: is explicit self-attention actually necessary for strong performance and reasoning? We argue that standard multi-head attention is best seen as a form of tensor lifting: hidden vectors are mapped into a high-dimensional space of pairwise interactions, and learning proceeds by constraining this lifted tensor through gradient descent. This mechanism is extremely expressive but mathematically opaque, because after many layers it becomes very hard to describe the model with a small family of explicit invariants. To explore an alternative, we propose an attention-free architecture based on Grassmann flows. Instead of forming an L by L attention matrix, our Causal Grassmann layer (i) linearly reduces token states, (ii) encodes local token pairs as two-dimensional subspaces on a Grassmann manifold via Plucker coordinates, and (iii) fuses these geometric features back into the hidden states through gated mixing. Information therefore propagates by controlled deformations of low-rank subspaces over multi-scale local windows, so the core computation lives on a finite-dimensional manifold rather than in an unstructured tensor space. On the Wikitext-2 language modeling benchmark, purely Grassmann-based models with 13 to 18 million parameters achieve validation perplexities within about 10 to 15 percent of size-matched Transformers. On the SNLI natural language inference task, a Grassmann-Plucker head on top of DistilBERT slightly outperforms a Transformer head, with best validation and test accuracies of 0.8550 and 0.8538 compared to 0.8545 and 0.8511. We analyze the complexity of Grassmann mixing, show linear scaling in sequence length for fixed rank, and argue that such manifold-based designs offer a more structured route toward geometric and invariant-based interpretations of neural reasoning.

Zhang Chong
arXiv:2512.19428 · cs.LG, cs.AI, math.AG · submitted Dec 22, 2025
abstract · pdf · html

add comment on HN
Also discussed: Jan 2026 (3 points, 2 comments) · Jan 2026 (4 points, 0 comments) · Jan 2026 (3 points, 0 comments)