Sigmoid-weighted Linear Units For Neural Network Function Approximation In Reinforcement Learning

Abstract

In recent years, neural networks have enjoyed a renaissance as function approximators in reinforcement learning. Two decades after Tesauro's TD-Gammon achieved near top-level human performance in backgammon, the deep reinforcement learning algorithm DQN achieved human-level performance in many Atari 2600 games. The purpose of this study is twofold. First, we propose two activation functions for neural network function approximation in reinforcement learning: the sigmoid-weighted linear unit (SiLU) and its derivative function (dSiLU). The activation of the SiLU is computed by the sigmoid function multiplied by its input. Second, we suggest that the more traditional approach of using on-policy learning with eligibility traces, instead of experience replay, and softmax action selection with simple annealing can be competitive with DQN, without the need for a separate target network. We validate our proposed approach by, first, achieving new state-of-the-art results in both stochastic SZ-T

Stats

• citations1658
• S2 citations—
• github stars0
• HF likes0
• heat score24.15
• arxiv keyelfwing2017sigmoid

Related papers

• A Finite-time Analysis Of Q-learning With Neural Network Function Approximation (2019)0.00
• Human-level Control Through Directly-trained Deep Spiking Q-networks (2021)12.40
• Toward Interpretable Deep Reinforcement Learning With Linear Model U-trees (2018)13.05
• Linear Function Approximation As A Computationally Efficient Method To Solve Classical Reinforcement Learning Challenges (2024)0.00
• Two-timescale Q-learning With Function Approximation In Zero-sum Stochastic Games (2023)0.00
• An Adaptive Synchronization Approach For Weights Of Deep Reinforcement Learning (2020)0.00
• Provably Efficient Reinforcement Learning With Linear Function Approximation (2019)11.76
• Deep Reinforcement Learning With Spiking Q-learning (2022)0.00