atlas

Research map / Optimization / Nonconvex and smooth optimization

Non-Asymptotic Guarantees for Average-Reward Q-Learning with Adaptive Stepsizes

NeurIPS 2025 · Optimization › Nonconvex and smooth optimization · approach: Coordinate and Adam convergence analysis · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Gives the first finite-time analysis of asynchronous average-reward Q-learning with adaptive per-state-action stepsizes, showing mean-square error in span seminorm converges at about O(1/k).

Problem

Average-reward Q-learning lacks finite-time convergence guarantees, especially in the asynchronous setting where only one state-action pair is updated per step.

Approach

Uses adaptive stepsizes that act as local clocks for each state-action pair in asynchronous average-reward Q-learning, and analyzes the mean-square error in the span seminorm.

Key results

Experimental setup

Metrics: mean-square error in span seminorm

Builds on: Q-learning average-reward reinforcement learning

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy