Expanding Attention: A Taylor-Series Route to Linear-Time Transformers with a Fixed Number of Recurrent States
The paper expands the exponential attention kernel into a truncated Taylor series of $n$ terms to create linear-time transformers with fixed recurrent states. This method reduces memory and increases decoding speed by replacing quadratic attention costs with a fixed number of recurrent states, achieving near-exact results for small truncation orders.