Lyapunov-Certified Direct Switching Theory for Q-Learning

📅 2026-04-21
📈 Citations: 0
Influential: 0
📄 PDF

career value

203K/year
🤖 AI Summary
This work addresses the lack of tight and computable theoretical guarantees in existing finite-time convergence analyses of Q-learning. By modeling constant-stepsize Q-learning for the first time as a stochastic switched linear system driven by martingale difference noise, the authors exploit the equivalence between Bellman error and stochastic policy dynamics to construct a Lyapunov analysis framework based on the joint spectral radius. This approach yields a tight finite-time bound on the final iteration error, where the convergence rate is precisely characterized by the joint spectral radius—strictly improving upon conventional row-sum bounds—and provides a verifiable quadratic Lyapunov certificate for stability and performance.

Technology Category

Application Category

📝 Abstract
Q-learning is one of the most fundamental algorithms in reinforcement learning. We analyze constant-stepsize Q-learning through a direct stochastic switching system representation. The key observation is that the Bellman maximization error can be represented exactly by a stochastic policy. Therefore, the Q-learning error admits a switched linear conditional-mean recursion with martingale-difference noise. The intrinsic drift rate is the joint spectral radius (JSR) of the direct switching family, which can be strictly smaller than the standard row-sum rate. Using this representation, we derive a finite-time final-iterate bound via a JSR-induced Lyapunov function and then give a computable quadratic-certificate version.
Problem

Research questions and friction points this paper is trying to address.

Q-learning
Lyapunov function
switched system
joint spectral radius
finite-time bound
Innovation

Methods, ideas, or system contributions that make the work stand out.

Lyapunov certification
Q-learning
switched linear system
joint spectral radius
finite-time bound
🔎 Similar Papers