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

arXiv:2610.14988 · cs.LG, cs.AI, math.OC, stat.ML · Submitted 2026-10-10 · Read on arXiv

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

Submitted: 2026-10-10

Updated: 2026-10-10

Terminology

• Q-learning — 1× in this paper · explained in 3 episodes
• Regularization — 1× in this paper · explained in 3 episodes

Sources

• From Set Convergence to Pointwise Convergence: Finite-Time Guarantees for Average-Reward Q-Learning with Adaptive Stepsizes
• Achieving $\varepsilon^{-2}$ Dependence for Average-Reward Q-Learning with a New Contraction Principle
• Sample Complexity of Average-Reward Q-Learning: From Single-agent to Federated Reinforcement Learning
• The Multiplicative Version of Azuma's Inequality, with an Application to Contention Analysis
• A unified view of entropy-regularized Markov decision processes
• On Convergence of Average-Reward Q-Learning in Weakly Communicating Markov Decision Processes
• Behavior Regularized Offline Reinforcement Learning

Related papers

• Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
• AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
• Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
• Convergence issues in Relational Concept Analysis based on AOC-posets
• Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks