From Gradients to Riccati Geometry: Kalman World Models for Single-Pass Learning

Andrew Kiruluta
3/13/2026
cs.LGcs.CL

No confident code implementation found for this paper.

Abstract

Backpropagation dominates modern machine learning, yet it is not the only principled method for optimizing dynamical systems. We propose Kalman World Models (KWM), a class of learned state-space models trained via recursive Bayesian filtering rather than reverse-mode automatic differentiation. Instead of gradient descent updates, we replace parameter learning with Kalman-style gain adaptation. Training becomes online filtering; error signals become innovations. We further extend this framework to transformer-based large language models (LLMs), where internal activations are treated as latent dynamical states corrected via innovation terms. This yields a gradient-free training and adaptation paradigm grounded in control theory. We derive stability conditions, analyze computational complexity, and provide empirical results on sequence modeling tasks demonstrating competitive performance with improved robustness and continual adaptation properties.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{kiruluta2026from,
  title  = {From Gradients to Riccati Geometry: Kalman World Models for Single-Pass Learning},
  author = {Andrew Kiruluta},
  year   = {2026},
  eprint = {2603.13423},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2603.13423v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2603.13423.svg)](https://codeofpaper.com/paper/2603.13423)

Discussion