跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+197新增论文
+151其中 AI 相关
+16已有论文修订
+91新增 AI 导读

arXiv 最近完成扫描:2026-11-22 08:44 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

统计 2026-11-21 11:24 — 2026-11-22 11:24(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-22 08:44最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-22 08:42(北京时间)
版本更新 · v2arXiv:2610.14988

Mixing Regularization for Average-Reward $Q$-Learning and $Q$-Planning

Julien Roger, Sam Bodmer, Jian Qian, Benjamin Riviere

原文摘要

The average-reward setting for reinforcement learning is challenging because, without discounting, the span-contraction of the Bellman operator depends on the mixing properties of the underlying Markov dynamics. Whereas existing work typically assumes contraction, for instance through environment mixing, we study regularization toward a given reward-agnostic, $m$-step mixing policy to control the mixing properties of the learned policy. Our central mixing lemma quantifies how the reference policy's mixing properties transfer to the resulting learned policies. In particular, a single regularizer-dependent quantity simultaneously controls the contraction of the regularized Bellman operator and the exploration of the resulting policies. A second regularizer-dependent quantity controls the bias introduced by regularization, revealing a trade-off between convergence speed and approximation accuracy. Building on this result, we establish finite-time guarantees for regularized $Q$-iteration, synchronous and single-trajectory $Q$-learning, and $Q$-planning. Under one-step mixing, our bounds for approximating the regularized fixed point match the classical model-query bound for relative value iteration and, up to logarithmic factors, an existing sample-complexity bound for synchronous $Q$-learning. We also establish finite-time guarantees under multi-step mixing. For $Q$-planning, we characterize how the planning horizon trades off boundary bias against sample complexity. Finally, we present numerical studies validating the analysis: (i) knowledge of a strong mixing policy improves convergence and exploration, with larger benefits under more severe bottlenecks; and (ii) the observed rankings of $α$-divergence regularizers by bias and convergence speed are consistent with our theoretical analysis.

cs.LG · cs.AI · math.OC · stat.ML