mlsanityData to 7 Oct 2026

A Unified Switching System Perspective and O.D.E. Analysis of Q-Learning Algorithms

arXiv 1912.02270 ↗First posted 4 Dec 2019math.OC cs.LG cs.SYcited by 14

Not on the map. Why?

Abstract (arXiv)

In this paper, we introduce a unified framework for analyzing a large family of Q-learning algorithms, based on switching system perspectives and ODE-based stochastic approximation. We show that the nonlinear ODE models associated with these Q-learning algorithms can be formulated as switched linear systems, and analyze their asymptotic stability by leveraging existing switching system theories. Our approach provides the first O.D.E. analysis of the asymptotic convergence of various Q-learning algorithms, including asynchronous Q-learning and averaging Q-learning. We also extend the approach to analyze Q-learning with linear function approximation and derive a new sufficient condition for its convergence.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). First posted on arXiv 4 Dec 2019.

Builds on

No reference list yet.

Built on by

Cited by year

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

14 papers.

Sort: