mlsanityData to 14 Oct 2026

RoPE attention is an exact forward-pass gradient step with softmax intact

arXiv 2609.06685 ↗First posted 6 Sep 2026stat.ML cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

We derive an exact gradient-step representation of the RoPE-softmax forward pass. For every deterministic RoPE-softmax attention head with arbitrary affine projection weights, we construct a query-dependent effective matrix Delta Mi satisfying yi = μi + ui^top Delta Mi, where μi is the uniform mean of the attended values and ui is the augmented query input. The construction applies the classical exponential divided difference ρ = φ1 to retain the softmax exactly. Its positive coefficients give a unit gradient-step representation on a query-conditioned quadratic objective. The same function connects the RoPE generator to exact positional finite differences. We derive a tokenwise formula for the error of reusing one query's matrix and prove that a nonconstant finite-cache head cannot admit a globally exact affine query readout. Reconstruction checks and frozen-reuse calibration on one pretrained Qwen2.5-0.5B layer verify the representation and quantify the correction required when one query's matrix is reused.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 3 of its 9 references that are in the map. First posted on arXiv 6 Sep 2026.

Builds on

3 of 9 references.

References · 3

  1. 2022Transformers learn in-context by gradient descentcited by 732
  2. 2021Linear Transformers Are Secretly Fast Weight Programmerscited by 502
  3. 2020Hopfield Networks is All You Needcited by 475

Built on by

Not cited yet.