Pith. sign in

REVIEW 1 cited by

Revisiting the Compositional Generalization Abilities of Neural Sequence Models

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 2203.07402 v1 pith:VXDDNPSO submitted 2022-03-14 cs.CL

classification cs.CL
keywords generalizationmodelscompositionalabilitiesperformanceseq-to-seqstandardtraining
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Compositional generalization is a fundamental trait in humans, allowing us to effortlessly combine known phrases to form novel sentences. Recent works have claimed that standard seq-to-seq models severely lack the ability to compositionally generalize. In this paper, we focus on one-shot primitive generalization as introduced by the popular SCAN benchmark. We demonstrate that modifying the training distribution in simple and intuitive ways enables standard seq-to-seq models to achieve near-perfect generalization performance, thereby showing that their compositional generalization abilities were previously underestimated. We perform detailed empirical analysis of this phenomenon. Our results indicate that the generalization performance of models is highly sensitive to the characteristics of the training data which should be carefully considered while designing such benchmarks in future.

Discussion (0). Continue with ORCID 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. Compositional Generalization Across Distributional Shifts with Sparse Tree Operations

    cs.AI 2024-12 conditional novelty 6.0 of 10

    Sparse Differentiable Tree Machine represents trees as sparse coordinate lists, enabling efficient tree operations via bit-shifts and extending the Differentiable Tree Machine to sequence-to-sequence tasks with strong...

Pith tools