Pith. sign in

REVIEW 1 cited by

Recursive Decoding: A Situated Cognition Approach to Compositional Generation in Grounded Language Understanding

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2201.11766 v2 pith:BXJCIXOW submitted 2022-01-27 cs.CL cs.AIcs.LG

classification cs.CLcs.AIcs.LG
keywords generalizationlanguagecompositionalgroundedgscanmodelsnovelunderstanding
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Compositional generalization is a troubling blind spot for neural language models. Recent efforts have presented techniques for improving a model's ability to encode novel combinations of known inputs, but less work has focused on generating novel combinations of known outputs. Here we focus on this latter "decode-side" form of generalization in the context of gSCAN, a synthetic benchmark for compositional generalization in grounded language understanding. We present Recursive Decoding (RD), a novel procedure for training and using seq2seq models, targeted towards decode-side generalization. Rather than generating an entire output sequence in one pass, models are trained to predict one token at a time. Inputs (i.e., the external gSCAN environment) are then incrementally updated based on predicted tokens, and re-encoded for the next decoder time step. RD thus decomposes a complex, out-of-distribution sequence generation task into a series of incremental predictions that each resemble what the model has already seen during training. RD yields dramatic improvement on two previously neglected generalization tasks in gSCAN. We provide analyses to elucidate these gains over failure of a baseline, and then discuss implications for generalization in naturalistic grounded language understanding, and seq2seq more generally.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Learning neuro-symbolic convergent term rewriting systems

    cs.AI 2025-07 conditional novelty 6.0 of 10

    Two modular neuro-symbolic systems learn to simplify formulas by imitating term rewriting steps, and the new FastNRS variant generalizes to deeper formulas while being far faster than the original.

Pith tools