math.OCMay 11, 2026

Switching-Geometry Analysis of Deflated Q-Value Iteration

Authors: Donghwan Lee

Organizations: Department of Electrical Engineering Korea Advanced Institute of Science and Technology (KAIST) Daejeon 34141, South Korea

Abstract

This paper develops a joint spectral radius (JSR) framework for analyzing rank-one deflated Q-value iteration (Q-VI) in discounted Markov decision process control. Focusing on an all-ones residual correction, we interpret the resulting algorithm through the geometry of switching systems and, to the best of our knowledge, give the first JSR-based convergence analysis of deflated Q-VI for policy optimization problems. Our analysis reveals that the standard Q-VI switching system model has JSR exactly the discount factor γ(0,1)γ\in (0,1), since all admissible subsystems share the all-ones vector as an invariant direction. By passing to the quotient space that removes this direction, we obtain a projected switching system model whose JSR governs the relevant error dynamics and may be strictly smaller than γγ. Therefore, the deflated Q-VI admits a potentially sharper convergence-rate characterization than the ambient-space γγ-bound. Finally, we prove that the correction is equivalent to a scalar recentering of standard Q-VI. Hence, the projected trajectory, and therefore the greedy-policy sequence, is unchanged relative to standard Q-VI initialized from the same point. The benefit of deflation is not a change in the induced decision-making problem, but a more precise JSR-based description of the convergence geometry after the redundant all-ones component is removed.

Explore similar work

Apr 19, 2026math.OC

Beyond the Bellman Fixed Point: Geometry and Fast Policy Identification in Value Iteration

Q-value iteration (Q-VI) is usually analyzed through the γγ-contraction of the Bellman operator. This argument proves convergence to QQ^*, but it gives only a coarse account of when the induced greedy policy becomes optimal. We study discounted Q-VI as a switching system and focus on the practically optimal solution set (POSS), the set of QQ-functions whose tie-broken greedy policies are optimal. The main result shows that Q-VI reaches the optimal action class in finite time by entering an invariant tube around X1=Q+span(1)\mathcal X_1=Q^*+\operatorname{span}(\mathbf 1), which is contained in the POSS. For every ε>0\varepsilon>0, the distance to X1\mathcal X_1 satisfies an exponential bound with rate (ρˉ+ε)k(\barρ+\varepsilon)^k, where ρˉ\barρ is the joint spectral radius of the projected switching family restricted to directions transverse to X1\mathcal X_1. When ρˉ<γ\barρ<γ, this transverse convergence is faster than the classical contraction rate. The analysis separates fast policy identification from the subsequent convergence to QQ^*, which may still be governed by the all-ones mode. We also give spectral and graph-theoretic conditions under which the strict inequality ρˉ<γ\barρ<γ holds or fails.
Donghwan Lee
Apr 21, 2026cs.LG

Lyapunov-Certified Direct Switching Theory for Q-Learning

Q-learning is a fundamental algorithmic primitive in reinforcement learning. This paper develops a new framework for analyzing Q-learning from a switching linear system (SLS) viewpoint. In particular, we derive a stochastic SLS representation of the Q-learning error, and a finite-time error analysis through the joint spectral radius (JSR) of the corresponding SLS model, where the JSR is the exact worst-case exponential rate of the associated SLS. To the best of our knowledge, this is the first convergence rate analysis of standard Q-learning whose leading exponential rate is expressed through the JSR. The resulting rate is tied to the intrinsic worst-case exponential rate of the direct SLS representation and can be sharper than row-sum upper bounds when those bounds are conservative.
Donghwan Lee
May 10, 2026cs.LG

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 for convergence of linear Q-learning, which can be less conservative than one-step norm bounds.
Donghwan Lee, Han-Dong Lim