Cited by 2,119Reinforcement Learning in RoboticsArtificial Intelligence in GamesNeural Networks and Applications

Sigmoid-Weighted Linear Units for Neural Network Function Approximation in Reinforcement Learning

Open access
Elfwing, Stefan, Uchibe, Eiji, Doya, Kenji·2018·Neural Networks

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 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-Tetris and Tetris with a small 10 × 10 board, using TD(λ) learning and shallow dSiLU network agents, and, then, by outperforming DQN in the Atari 2600 domain by using a deep Sarsa(λ) agent with SiLU and dSiLU hidden units.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.neunet.2017.12.012

Cites

26 of 26 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 9

  1. Elfwing, S., Uchibe, E., & Doya, K. (2017). Sigmoid-weighted linear units for neu- ral network function approximation in reinforcement learning. arXiv:1702. 03118 [cs.LG].
  2. Morgan Kaufmann.
  3. Nair, A., Srinivasan, P., Blackwell, S., Alcicek, C., Fearon, R., & Maria, A. D. et al., (2015). Massively parallel methods for deep reinforcement learning. arXiv: 1507.04296 [cs.LG]. · arXiv
  4. Ramachandran, P., Zoph, B., & Le, Q. V. (2017). Searching for activation functions. arXiv:1710.05941 [cs.NE]. · arXiv
  5. Rummery, G. A., & Niranjan, M. (1994). On-line Q-learning using connectionist systems. Tech. Rep. CUED/F-INFENG/TR 166, Cambridge University Engineering Department.
  6. Schaul, T., Quan, J., Antonoglou, I., & Silver, D. (2016). Prioritized experience replay. In International conference on learning representations, Puerto Rico.
  7. Szita, I., & Szepesvári, C. (2010). SZ-Tetris as a benchmark for studying key problems of reinforcement learning. In ICML 2010 workshop on machine learning and games.
  8. van Hasselt, H. (2010). Double q-learning. In Proceedings of advances in neural information processing systems (pp. 2613-2621).
  9. van Hasselt, H., Guez, A., & Silver, D. (2015). Deep Reinforcement learning with double q-learning. arXiv:1509.06461 [cs.LG]. · arXiv

Cited by

Sorted by citations

Authors
Elfwing, S., Uchibe, E., & Doya, K.
Affiliations
  • Advanced Telecommunications Research Institute International (JP)
  • Okinawa Institute of Science and Technology Graduate University (JP)
Corresponding author
Elfwing, Stefan
Venue
Neural Networks
Publisher
Elsevier BV
Published
2018-11
Volume
107
Pages
3-11
ISSN
0893-6080 (ISSN-L)
OpenAlex
W2962834855
Cited by
2,119
References
26
Citations by year
2026: 408 · 2025: 584 · 2024: 428 · 2023: 319 · 2022: 162 · 2021: 109 · 2020: 49 · 2019: 41 · 2018: 17 · 2017: 2
FWCI
30.43
Type
journal article
Language
en
Open access
Locations
  • Neural Networks (publishedVersion, cc-by-nc-nd)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • Institutional Repositories DataBase (IRDB) (submittedVersion, cc-by-nc-nd)
  • Okinawa Institute of Science and Technology Graduate University (Okinawa Institute of Science and Technology Graduate University) (submittedVersion, cc-by-nc-nd)
  • arXiv (Cornell University)
Funders
  • New Energy and Industrial Technology Development Organization (NEDO)
  • MEXT KAKENHI (16H06563, 17H06042)
  • Okinawa Institute of Science and Technology Graduate University
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
  • Physical Sciences › Computer Science › Artificial Intelligence › Artificial Intelligence in Games
  • Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
Keywords
neural network function approximation, reinforcement learning, deep Q-network, on-policy learning, eligibility traces, Sarsa(lambda), Tetris, Atari 2600, target network
MeSH terms
Deep Learning, Neural Networks, Computer

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review