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 zero-shot lexical generalization.
Revisiting the Compositional Generalization Abilities of Neural Sequence Models
1 Pith paper cite this work. Polarity classification is still indexing.
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.
citation-role summary
citation-polarity summary
fields
cs.AI 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Compositional Generalization Across Distributional Shifts with Sparse Tree Operations
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 zero-shot lexical generalization.