In two-player random potential games with many actions, simultaneous best-response dynamics converge with high probability to a two-cycle whose off-diagonal profiles are Nash equilibria; simulations indicate convergence to a Nash equilibrium for three or more players.
Soft Policy Gradient Method for Maximum Entropy Deep Reinforcement Learning
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Maximum entropy deep reinforcement learning (RL) methods have been demonstrated on a range of challenging continuous tasks. However, existing methods either suffer from severe instability when training on large off-policy data or cannot scale to tasks with very high state and action dimensionality such as 3D humanoid locomotion. Besides, the optimality of desired Boltzmann policy set for non-optimal soft value function is not persuasive enough. In this paper, we first derive soft policy gradient based on entropy regularized expected reward objective for RL with continuous actions. Then, we present an off-policy actor-critic, model-free maximum entropy deep RL algorithm called deep soft policy gradient (DSPG) by combining soft policy gradient with soft Bellman equation. To ensure stable learning while eliminating the need of two separate critics for soft value functions, we leverage double sampling approach to making the soft Bellman equation tractable. The experimental results demonstrate that our method outperforms in performance over off-policy prior methods.
fields
cs.GT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Simultaneous Best-Response Dynamics in Random Potential Games
In two-player random potential games with many actions, simultaneous best-response dynamics converge with high probability to a two-cycle whose off-diagonal profiles are Nash equilibria; simulations indicate convergence to a Nash equilibrium for three or more players.