AI Research Atlas
Technical report

Recurrent learning

Learning while a sequence unfolds

Dynamic networks extended error-based learning from static patterns to time-varying streams.

A. J. Robinson and F. Fallside

AI topics

Explore related entries. Larger tags appear on more entries.

The contribution

Robinson and Fallside explored architectures for learning finite sequences as well as streams whose length is not known in advance. Their report developed dynamic state representations, examples including speech coding, and a utility signal for training behavior. It belongs to the early work on learning in systems whose current output depends on prior activity.

What this does not establish

The report analyzes particular architectures and examples. Its claims do not establish unlimited memory or reliable learning across arbitrarily long sequences.

Why this date?

The report is dated 4 November 1987 and identified as CUED/F-INFENG/TR.1. LSTM cites this technical report, not Robinson's later doctoral thesis.

This entry follows the linked publication. Read the source and date conventions.

Comments

Discuss this research, ask a question, or suggest a correction. Comments appear after the site owner approves them.

Loading comments…

Sign in with ChatGPT to comment

Use your OpenAI account. Published comments show the display name you choose, not your account email.