pith. sign in

arxiv: 1702.03118 · v3 · pith:7SCJRFBKnew · submitted 2017-02-10 · 💻 cs.LG

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

classification 💻 cs.LG
keywords learningfunctionnetworkreinforcementdsiluneuralsiluachieved
0
0 comments X
read the original 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-Tetris and Tetris with a small 10$\times$10 board, using TD($\lambda$) learning and shallow dSiLU network agents, and, then, by outperforming DQN in the Atari 2600 domain by using a deep Sarsa($\lambda$) agent with SiLU and dSiLU hidden units.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 7 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Augmenting Molecular Language Models with Local $n$-gram Memory

    cs.CL 2026-06 unverdicted novelty 7.0

    MolGram integrates a conditional n-gram memory module into molecular language models to address locality gaps in SMILES tokenization, improving performance on generation, forward prediction, and retrosynthesis while o...

  2. Actions Speak Louder than Words: Trillion-Parameter Sequential Transducers for Generative Recommendations

    cs.LG 2024-02 unverdicted novelty 7.0

    HSTU-based generative recommenders with 1.5 trillion parameters scale as a power law with compute up to GPT-3 scale, outperform baselines by up to 65.8% NDCG, run 5-15x faster than FlashAttention2 on long sequences, a...

  3. Searching for Activation Functions

    cs.NE 2017-10 conditional novelty 7.0

    Automated search discovers Swish activation f(x) = x * sigmoid(βx) that improves top-1 ImageNet accuracy over ReLU by 0.9% on Mobile NASNet-A and 0.6% on Inception-ResNet-v2.

  4. Don't Listen to Me: A Lightweight, Low-Latency Model for Own-Voice Cancellation in Far-Field Speech Enhancement

    eess.AS 2026-06 unverdicted novelty 6.0

    Introduces own-voice cancellation as a complement to target speaker extraction and benchmarks lightweight 2 ms latency models for far-field speech enhancement.

  5. Overlap-aware segmentation for topological reconstruction of obscured objects

    hep-ex 2025-10 unverdicted novelty 6.0

    OASIS improves median intensity reconstruction error for low-energy electron tracks from -41.1% to -13.3% by weighting overlap regions in the training loss for the MIGDAL optical TPC.

  6. Short window attention enables long-term memorization

    cs.LG 2025-09 unverdicted novelty 6.0

    Short sliding windows in hybrid attention-xLSTM models boost long-context performance by encouraging long-term memory use, and stochastic window sizing improves both short and long tasks.

  7. Lyman-$\alpha$ forest constraints on pure and mixed fuzzy dark matter

    astro-ph.CO 2026-06 unverdicted novelty 5.0

    Lyman-alpha forest data yield m_FDM > 1.9e-21 eV (95% CL) for pure FDM and f_FDM upper limits of 0.07-0.65 for mixed FDM at log10(m_FDM/eV) = -23 to -21.