Abstract
We investigate the learning of deterministic finite-state automata (DFA's) with recurrent networks with a single input neuron, where each input symbol is represented as a temporal pattern and strings as sequences of temporal patterns. We empirically demonstrate that obvious temporal encodings can make learning very difficult or even impossible. Based on preliminary results, we formulate some hypotheses about 'good' temporal encoding, i.e. encodings which do not significantly increase training time compared to training of networks with multiple input neurons.
| Original language | English (US) |
|---|---|
| Title of host publication | IEEE International Conference on Neural Networks - Conference Proceedings |
| Publisher | IEEE |
| Pages | 1267-1272 |
| Number of pages | 6 |
| Volume | 2 |
| State | Published - 1994 |
| Event | Proceedings of the 1994 IEEE International Conference on Neural Networks. Part 1 (of 7) - Orlando, FL, USA Duration: Jun 27 1994 → Jun 29 1994 |
Other
| Other | Proceedings of the 1994 IEEE International Conference on Neural Networks. Part 1 (of 7) |
|---|---|
| City | Orlando, FL, USA |
| Period | 6/27/94 → 6/29/94 |
All Science Journal Classification (ASJC) codes
- Software
Fingerprint
Dive into the research topics of 'Training recurrent neural networks with temporal input encodings'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver