Target Entropy Annealing for Discrete Soft Actor-Critic
About
Soft Actor-Critic (SAC) is considered the state-of-the-art algorithm in continuous action space settings. It uses the maximum entropy framework for efficiency and stability, and applies a heuristic temperature Lagrange term to tune the temperature $\alpha$, which determines how "soft" the policy should be. It is counter-intuitive that empirical evidence shows SAC does not perform well in discrete domains. In this paper we investigate the possible explanations for this phenomenon and propose Target Entropy Scheduled SAC (TES-SAC), an annealing method for the target entropy parameter applied on SAC. Target entropy is a constant in the temperature Lagrange term and represents the target policy entropy in discrete SAC. We compare our method on Atari 2600 games with different constant target entropy SAC, and analyze on how our scheduling affects SAC.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Continual Learning | Atari Normalized continual learning | Max Performance0.18 | 9 | |
| Continual Reinforcement Learning | CoinRun Normalized Continual Learning | Max Performance0.9 | 9 | |
| Continual Reinforcement Learning | CoinRun | Forgetting-0.012 | 3 | |
| Continual Reinforcement Learning | CoinRun Reversed task order | Forgetting-0.029 | 3 | |
| Continual Reinforcement Learning | Atari Default task order | Forgetting0.194 | 3 | |
| Continual Reinforcement Learning | CoinRun Two-cycle (train) | C1 Final Score0.022 | 3 | |
| Continual Reinforcement Learning | Atari Reversed task order | Forgetting0.039 | 3 | |
| Continual Reinforcement Learning | Atari Two-cycle (train) | C1 Forward Score0.194 | 3 |