liveBook · Manning

Recurrence

As explained in Sutskever's List

Recurrence is an architectural mechanism that performs repeated state or representation updates across sequential or iterative computation steps.

Recurrence gives sequence models an explicit inductive bias for order by making computation depend on sequential steps. In debates over Transformers, critics questioned whether positional encodings could replace this bias. section 5.1.2

Experiments complicated that objection. A four-layer Transformer trained on roughly 40,000 Penn Treebank Wall Street Journal sentences reached 91.3 F1 on constituency parsing, surpassing earlier RNN-based seq2seq models without task-specific architecture changes. On translation, Transformers also learned positional information better than recurrent models. section 5.1.1 section 5.1.2

Recurrence offers an elegant prior for sequence order, but these results suggest it is not required for strong sequence-task performance. Its costs can include added complexity, reduced parallelism, and weaker modeling of long-range dependencies. section 5.1.1 section 5.1.2

How Sutskever's List covers it

How deep it goes
Explains recurrence as an order-related inductive bias and weighs its costs against sequence-task results.
Examples
Uses Penn Treebank parsing results and word-reordering tests to compare recurrent models with Transformers.
What you can do after
Evaluate recurrence as a useful sequence-order prior rather than a requirement for strong sequence-task performance.
How it connects
Connects recurrence to RNNs, Transformers, self-attention, and positional encodings.

Also explained in

Compare how 3 books explain recurrence →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Sutskever's List. The section links point to the parts of the book it draws on.