Average-Reward Soft Actor-Critic

The average-reward formulation of reinforcement learning (RL) has drawn increased interest in recent years for its ability to solve temporally-extended problems without relying on discounting. Meanwhile, in the discounted setting, algorithms with entropy regularization have been developed, leading to improvements over deterministic methods. Despite the distinct benefits of these approaches, deep RL algorithms for the entropy-regularized average-reward objective have not been developed. While policy-gradient based approaches have recently been presented for the average-reward literature, the corresponding actor-critic framework remains less explored. In this paper, we introduce an average-reward soft actor-critic algorithm to address these gaps in the field. We validate our method by comparing with existing average-reward algorithms on standard RL benchmarks, achieving superior performance for the average-reward criterion.

Authors

• Jacob Adamczyk University of Massachusetts Boston The NSF Institute for Artificial Intelligence and Fundamental Interactions
• Volodymyr Makarenko San Jose State University
• Stas Tiomkin Texas Tech University
• Rahul V Kulkarni

Keywords

No keywords are indexed for this paper.