Learning beyond finite memory in recurrent networks of spiking neurons

Authors:
Peter Tiňo;Ashley Mills
Affiliations:
School of Computer Science, University of Birmingham, Birmingham, UK;School of Computer Science, University of Birmingham, Birmingham, UK
Venue:
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part II
Year:
2005

Citing 14
Cited 2

Learning and extracting finite state automata with second-order recurrent neural networks

Neural Computation
Learning and extracting initial mealy automata with a modular neural network model

Neural Computation
On the computational power of neural nets

Journal of Computer and System Sciences
Learning the initial state of a second-order recurrent neural network during regular-language inference

Neural Computation
Spiking neurons

Pulsed neural networks
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Synapses as dynamic memory buffers

Neural Networks
Natural Language Grammatical Inference with Recurrent Neural Networks

IEEE Transactions on Knowledge and Data Engineering
Spiking neurons and the induction of finite state machines

Theoretical Computer Science - Natural computing
Real-time computing without stable states: a new framework for neural computation based on perturbations

Neural Computation
From Wheels to Wings with Evolutionary Spiking Circuits

Artificial Life
Neural Coding: Higher-Order Temporal Patterns in the Neurostatistics of Cell Assemblies

Neural Computation
The dynamics of discrete-time computation, with application to recurrent neural networks and finite state machine extraction

Neural Computation
Lower bounds for the computational power of networks of spiking neurons

Neural Computation

Supervised learning in spiking neural networks with resume: Sequence learning, classification, and spike shifting

Neural Computation
Supervised learning in multilayer spiking neural networks

Neural Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate possibilities of inducing temporal structures without fading memory in recurrent networks of spiking neurons strictly operating in the pulse-coding regime. We extend the existing gradient-based algorithm for training feed-forward spiking neuron networks (Spike-Prop [1]) to recurrent network topologies, so that temporal dependencies in the input stream are taken into account. It is shown that temporal structures with unbounded input memory specified by simple Moore machines (MM) can be induced by recurrent spiking neuron networks (RSNN). The networks are able to discover pulse-coded representations of abstract information processing states coding potentially unbounded histories of processed inputs.