Reservoir computing

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Reservoir computing is a framework for computation that may be viewed as an extension of neural networks.[1] Typically an input signal is fed into a fixed (random) dynamical system called a reservoir and the dynamics of the reservoir map the input to a higher dimension. Then a simple readout mechanism is trained to read the state of the reservoir and map it to the desired output. The main benefit is that the training is performed only at the readout stage and the reservoir is fixed. Liquid-state machines[2] and echo state networks[3] are two major types of reservoir computing.[4]

Reservoir[edit]

The reservoir consists of a collection of recurrently connected units. The connectivity structure is usually random, and the units are usually non-linear. The overall dynamics of the reservoir is driven by the input, and also affected by the past. A rich collection of dynamical input-output mapping is a crucial advantage over simple time delay neural networks.

Readout[edit]

The readout is carried out using a linear transformation of the reservoir output. This transformation is adapted to the task of interest by using a linear regression or a Ridge regression using a teaching signal.

Types[edit]

Context reverberation network[edit]

An early example of reservoir computing was the context reverberation network.[5] In this architecture, an input layer feeds into a high dimensional dynamical system which is read out by a trainable single-layer perceptron. Two kinds of dynamical system were described: a recurrent neural network with fixed random weights, and a continuous reaction-diffusion system inspired by Alan Turing’s model of morphogenesis. At the trainable layer, the perceptron associates current inputs with the signals that reverberate in the dynamical system; the latter were said to provide a dynamic "context" for the inputs. In the language of later work, the reaction-diffusion system served as the reservoir.

Echo state network[edit]

Backpropagation-decorrelation[edit]

Backpropagation-Decorrelation (BPDC)

Liquid-state machine[edit]

Reservoir Computing for Structured Data[edit]

The Tree Echo State Network [6] (TreeESN) model represents a generalization of the Reservoir Computing framework to tree structured data.

Deep Reservoir Computing[edit]

The extension of the Reservoir Computing framework towards Deep Learning, with the introduction of Deep Reservoir Computing and of the Deep Echo State Network (deepESN) model [7][8] allows to develop efficiently trained models for hierarchical processing of temporal data, at the same time enabling the investigation on the inherent role of layered composition in recurrent neural networks.

See also[edit]

References[edit]

  1. ^ Schrauwen, Benjamin, David Verstraeten, and Jan Van Campenhout. "An overview of reservoir computing: theory, applications, and implementations." Proceedings of the European Symposium on Artificial Neural Networks ESANN 2007, pp. 471-482.
  2. ^ Mass, Wolfgang, T. Nachtschlaeger, and H. Markram. "Real-time computing without stable states: A new framework for neural computation based on perturbations." Neural Computation 14(11): 2531–2560 (2002).
  3. ^ Jaeger, Herbert, "The echo state approach to analyzing and training recurrent neural networks." Technical Report 154 (2001), German National Research Center for Information Technology.
  4. ^ Echo state network, Scholarpedia
  5. ^ Kirby, Kevin. "Context dynamics in neural sequential learning." Proceedings of the Florida Artificial Intelligence Research Symposium FLAIRS (1991), 66-70.
  6. ^ Gallicchio, Claudio; Micheli, Alessio (2013). "Tree Echo State Networks". Neurocomputing. 101: 319–337. 
  7. ^ Gallicchio, Claudio; Micheli, Alessio; Pedrelli, Luca. "Deep reservoir computing: A critical experimental analysis". Neurocomputing. doi:10.1016/j.neucom.2016.12.089. 
  8. ^ Gallicchio, Claudio; Micheli, Alessio (2017-05-05). "Echo State Property of Deep Reservoir Computing Networks". Cognitive Computation. ISSN 1866-9956. doi:10.1007/s12559-017-9461-9. 

Further reading[edit]