mlsanityData to 14 Oct 2026

Kalman Temporal Differences

arXiv 1406.3270 ↗First posted 16 Jan 2014cs.LGcited by 10

Not on the map. Why?

Abstract (arXiv)

Because reinforcement learning suffers from a lack of scalability, online value (and Q-) function approximation has received increasing interest this last decade. This contribution introduces a novel approximation scheme, namely the Kalman Temporal Differences (KTD) framework, that exhibits the following features: sample-efficiency, non-linear approximation, non-stationarity handling and uncertainty management. A first KTD-based algorithm is provided for deterministic Markov Decision Processes (MDP) which produces biased estimates in the case of stochastic transitions. Than the eXtended KTD framework (XKTD), solving stochastic MDP, is described. Convergence is analyzed for special cases for both deterministic and stochastic transitions. Related algorithms are experimented on classical benchmarks. They compare favorably to the state of the art while exhibiting the announced features.

Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). First posted on arXiv 16 Jan 2014.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 3; 2022: 1; 2023: 1; 2024: 3; 2025: 0; 2026: 2.

10 papers.