Pith. sign in

REVIEW 1 cited by

Refined Gate: A Simple and Effective Gating Mechanism for Recurrent Units

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2002.11338 v2 pith:TTYTTEUC submitted 2020-02-26 cs.CV cs.LGcs.NE

classification cs.CVcs.LGcs.NE
keywords gatinggatemechanismgateslstmrecurrenttasksactivation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recurrent neural network (RNN) has been widely studied in sequence learning tasks, while the mainstream models (e.g., LSTM and GRU) rely on the gating mechanism (in control of how information flows between hidden states). However, the vanilla gates in RNN (e.g., the input gate in LSTM) suffer from the problem of gate undertraining, which can be caused by various factors, such as the saturating activation functions, the gate layouts (e.g., the gate number and gating functions), or even the suboptimal memory state etc.. Those may result in failures of learning gating switch roles and thus the weak performance. In this paper, we propose a new gating mechanism within general gated recurrent neural networks to handle this issue. Specifically, the proposed gates directly short connect the extracted input features to the outputs of vanilla gates, denoted as refined gates. The refining mechanism allows enhancing gradient back-propagation as well as extending the gating activation scope, which can guide RNN to reach possibly deeper minima. We verify the proposed gating mechanism on three popular types of gated RNNs including LSTM, GRU and MGU. Extensive experiments on 3 synthetic tasks, 3 language modeling tasks and 5 scene text recognition benchmarks demonstrate the effectiveness of our method.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. SigGate: Enhancing Recurrent Neural Networks with Signature-Based Gating Mechanisms

    cs.LG 2025-02 reject novelty 4.0 of 10

    A signature-based forget/reset gate that ignores the hidden state yields small and task-dependent R2 changes on two crypto forecasting tasks, not the consistent improvement claimed.

Pith tools