vix.ing · top · new · best · stats · spec

Variance-Reduced Cascade Q-learning: Algorithms and Sample Complexity

2024/08/13 by Mohammad Boveiri, Peyman Mohajerin Esfahani, Boveiri, Mohammad +1
Computer Science · Engineering · #Anomaly Detection Techniques and Applications #Data Stream Mining Techniques #FOS: Computer and information sciences #FOS: Electrical engineering #FOS: Mathematics #Fault Detection and Control Systems #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Optimization and Control (math.OC) #Systems and Control (eess.SY) #electronic engineering #information engineering

paper · pdf · doi:10.48550/arxiv.2408.06544

openalex publication_date 2024/08/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We study the problem of estimating the optimal Q-function of γ-discounted Markov decision processes (MDPs) under the synchronous setting, where independent samples for all state-action pairs are drawn from a generative model at each iteration. We introduce and analyze a novel model-free algorithm called Variance-Reduced Cascade Q-learning (VRCQ). VRCQ comprises two key building blocks: (i) the established direct variance reduction technique and (ii) our proposed variance reduction scheme, Cascade Q-learning. By leveraging these techniques, VRCQ provides superior guarantees in the ℓ_∞-norm compared with the existing model-free stochastic approximation-type algorithms. Specifically, we demonstrate that VRCQ is minimax optimal. Additionally, when the action set is a singleton (so that the Q-learning problem reduces to policy evaluation), it achieves non-asymptotic instance optimality while requiring the minimum number of samples theoretically possible. Our theoretical results and their practical implications are supported by numerical experiments.

Related