A Harmonic Mean Formulation of Average Reward Reinforcement Learning in SMDPs
Not on the map. Why?
Abstract (arXiv)
Recent research has revived and amplified interest in algorithms for undiscounted average reward reinforcement learning in infinite-horizon, non-episodic (continuing) tasks. Semi-Markov decision processes (SMDPs) are of particular interest. In SMDPs, discrete actions stochastically generate both rewards and durations, and the objective is to optimize the average reward rate. Existing algorithms approach this by optimizing the ratio of rewards to durations. However, when rewards and durations are non-stationary (in the infinite horizon), this can be incorrect. This paper presents a novel modified harmonic mean operator that correctly computes reward rates even under such conditions. This yields model-free learning algorithms that can work with SMDPs, while maintaining robustness to non-stationary reward and duration distributions over time. We prove theoretical properties of the modified harmonic mean operator, and empirically demonstrate its efficacy in comparison to existing algorithms.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 4 of its 19 references that are in the map. First posted on arXiv 6 May 2026.
Builds on
4 of 19 references.
References · 4
- 2020Average-reward model-free reinforcement learning: a systematic review and literature mappingcited by 19
- 2021Average-Reward Reinforcement Learning with Trust Region Methodscited by 18
- 2020Deep R-Learning for Continual Area Sweepingcited by 5
- 2018Bitcoin market route to maturity? Evidence from return fluctuations, temporal correlations and multiscaling effectscited by 3
Built on by
Not cited yet.