liveBook · Manning

Permutation-invariant encoder

As explained in Sutskever's List

A permutation-invariant encoder is an encoder whose representation is unchanged when the order of its input elements is permuted.

A permutation-invariant encoder produces the same representation when the elements of its input are reordered. In Read-Process-Write (RPW), this lets the model handle unordered inputs; a specially designed loss can learn a suitable output ordering instead of fixing one in advance. section 5.6

Learning an ordering for 5-grams

In an illustrative 5-gram experiment, learning an ordering reduced perplexity from about 280 with a poor fixed order to about 225 with a learned near-optimal order. section 5.6

How Sutskever's List covers it

How deep it goes
Defines invariance to input permutations and describes a loss that shifts toward predicted output orderings.
Examples
Compares poor fixed and learned near-optimal orderings in an illustrative 5-gram experiment.
What you can do after
Understand how permutation-invariant encoding and learned ordering address sensitivity to input sequence.
How it connects
Connects permutation-invariant encoding to sequence-to-sequence models, attention, Transformers, and recurrent neural networks.

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.