Sign inGet started
Paper · arXiv

A Switching System Theory of Q-Learning with Linear Function Approximation

Q-learning is a fundamental algorithmic primitive in reinforcement learning. This paper develops a new framework for analyzing linear Q-learning from a switching linear system (SLS) viewpoint, where linear Q-learning denotes Q-learning with linear function approximation. We derive a stochastic SLS representation of the linear Q-learning error and obtain a finite-time error analysis for linear Q-learning through the joint spectral radius (JSR) of the associated SLS family; the JSR is the exact worst-case exponential rate of the corresponding SLSs. The JSR-based rate is tied to the intrinsic worst-case exponential rate of the SLS representation. Moreover, we provide a JSR-based certificate ...

AuthorsDonghwan Lee, Han-Dong Lim
Primary categorycs.LG
Published10 May 2026
Last updated at source3 July 2026
cs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/713ebed2-cc7b-4e05-aee5-3c166bc56c16" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.