mlsanityData to 7 Oct 2026

Warming up recurrent neural networks to maximise reachable multistability greatly improves learning

arXiv 2106.01001 ↗First posted 2 Jun 2021cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

Training recurrent neural networks is known to be difficult when time dependencies become long. In this work, we show that most standard cells only have one stable equilibrium at initialisation, and that learning on tasks with long time dependencies generally occurs once the number of network stable equilibria increases; a property known as multistability. Multistability is often not easily attained by initially monostable networks, making learning of long time dependencies between inputs and outputs difficult. This insight leads to the design of a novel way to initialise any recurrent cell connectivity through a procedure called "warmup" to improve its capability to learn arbitrarily long time dependencies. This initialisation procedure is designed to maximise network reachable multistability, i.e., the number of equilibria within the network that can be reached through relevant input trajectories, in few gradient steps. We show on several information restitution, sequence classification, and reinforcement learning benchmarks that warming up greatly improves learning speed and performance, for multiple recurrent cells, but sometimes impedes precision. We therefore introduce a double-layer architecture initialised with a partial warmup that is shown to greatly improve learning of long time dependencies while maintaining high levels of precision. This approach provides a general framework for improving learning abilities of any recurrent cell when long time dependencies are present. We also show empirically that other initialisation and pretraining procedures from the literature implicitly foster reachable multistability of recurrent cells.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 17 of its 39 references that are in the map. First posted on arXiv 2 Jun 2021.

Builds on

17 of 39 references.

References · 17

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2014Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modelingcited by 2,341
  3. 2014On the Properties of Neural Machine Translation: Encoder-Decoder Approachescited by 1,303
  4. 2015Deep Recurrent Q-Learning for Partially Observable MDPscited by 457
  5. 2016Hierarchical Multiscale Recurrent Neural Networkscited by 102
  6. 2014A Clockwork RNNcited by 70
  7. 2018Learning Longer-term Dependencies in RNNs with Auxiliary Lossescited by 58
  8. 2018Can recurrent neural networks warp time?cited by 53
  9. 2016Minimal Gated Unit for Recurrent Neural Networkscited by 40
  10. 2019Reverse engineering recurrent networks for sentiment classification reveals line attractor dynamicscited by 38
  11. 2018The unreasonable effectiveness of the forget gatecited by 32
  12. 2017Gated Orthogonal Recurrent Units: On Learning to Forgetcited by 31
5 more
  1. 2018Interpreting recurrent neural networks behaviour via excitable network attractorscited by 15
  2. 2014Learning Longer Memory in Recurrent Neural Networkscited by 11
  3. 2015Recurrent Neural Network Training with Dark Knowledge Transfercited by 8
  4. 2020A bio-inspired bistable recurrent cell allows for long-lasting memorycited by 8
  5. 2019Supervised level-wise pretraining for recurrent neural network initialization in multi-class classificationcited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 3.

3 papers.