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

arXiv:2610.14988v1 Announce Type: new Abstract: The average-reward setting for reinforcement learning is challenging because its Bellman operator is known to contract in span only when the underlying Markov chain is mixing. Whereas existing work typically assumes a contraction property, e.g., through environment mixing, we consider the setting where we are given a reward-agnostic m-step mixing policy, and we control the contraction and exploration properties of the learned policy by regularizing toward the mixing policy. We provide finite-time analysis of Q-learning algorithms that can be instantiated with multiple choices of regularization, with guarantees measured with respect to the regularized fixed point. Our framework exposes novel regularizer-dependent objects that control contraction, exploration, and operator bias. In the one-step setting, our rates match the best known rates for Q-iteration and synchronous Q-learning, and for m-step mixing we derive new rates. We also study Q-planning variants, and show that planning acts as time-localized learning, where the planning horizon H trades off the bias from the boundary value against the sample complexity. Finally, we present numerical studies validating the analysis: (i) knowledge of a strong mixing policy improves convergence and exploration, and its advantage increases with bottleneck severity and, (ii) our theory predicts the convergence and bias rankings of regularizers from the alpha-divergence family.

Related

• Bridging the Gap Between Average and Discounted TD Learning
• Quotient-Categorical Representations for Bellman-Compatible Average-Reward Distributional Reinforcement Learning
• Model-Free Robust Average-Reward Reinforcement Learning with Sample Complexity Analysis
• Average-Reward Reinforcement Learning for Multichain MDPs: A Hierarchical Decomposition Approach

Source: arXiv cs.LG | 2026-10-14