Kalman Linear Attention:
Parallel Bayesian Filtering For Efficient Language Modelling and State Tracking

Author

Vaisakh Shaj1, Cameron Barker1, Aidan Scannell1, Andras Szecsenyi1, Elliot J. Crowley2, Amos Storkey1

Affiliations

1 School of Informatics, University of Edinburgh

2 School of Engineering, University of Edinburgh

Posted

February 11, 2026

Venue / status

ICML 2026

Overview

Kalman Linear Attention (KLA) brings Bayesian filtering into language models. It maintains a state estimate and its uncertainty, using both to decide how much information to retain and how much to learn from each new token. We reformulate the Kalman filter’s nonlinear updates as associative scans, enabling parallel training with computation that grows linearly with sequence length.

KLA improves state tracking while remaining competitive with modern state-space models on language-modelling benchmarks. It also complements attention: replacing the final attention layer of a 180M-parameter GPT with KLA raises average zero-shot accuracy across eight benchmarks from 42.20% to 44.95%.

Poster

Kalman Linear Attention conference poster showing the Bayesian filtering formulation, parallel scan algorithm, and results on runtime, state tracking, and language modelling.

KLA’s method and experimental results. View the poster at full size.