about
Testing Compositional Generalization in Recurrent Networks [pdf] (arxiv.org)
3 points by stablemap on Jul 24, 2018 | hide | past | pdf | discuss on HN

In plain words: Tested whether networks that turn instructions into actions can recombine familiar words like "around" and "right" in new ways, without learning new meanings. They succeed only after many examples of the same pattern, but fail when a rule must be applied in a new way.

Abstract · Rearranging the Familiar: Testing Compositional Generalization in Recurrent Networks

Systematic compositionality is the ability to recombine meaningful units with regular and predictable outcomes, and it's seen as key to humans' capacity for generalization in language. Recent work has studied systematic compositionality in modern seq2seq models using generalization to novel navigation instructions in a grounded environment as a probing tool, requiring models to quickly bootstrap the meaning of new words. We extend this framework here to settings where the model needs only to recombine well-trained functional words (such as "around" and "right") in novel contexts. Our findings confirm and strengthen the earlier ones: seq2seq models can be impressively good at generalizing to novel combinations of previously-seen input, but only when they receive extensive training on the specific pattern to be generalized (e.g., generalizing from many examples of "X around right" to "jump around right"), while failing when generalization requires novel application of compositional rules (e.g., inferring the meaning of "around right" from those of "right" and "around").

João Loula, Marco Baroni, Brenden M. Lake
arXiv:1807.07545 · cs.CL, cs.AI, cs.LG · submitted Jul 19, 2018
abstract · pdf · html

add comment on HN