← Search

Paul Smolensky

7 accepted papers

2024

Compositional Generalization Across Distributional Shifts with Sparse Tree Operations

NeurIPS 2024spotlight

Neural networks continue to struggle with compositional generalization, and this issue is exacerbated by a lack of massive pre-training. One successful approach for developing neural systems which exhibit human-like compositional generalization is $\textit{hybrid}$ neurosymbolic techniques. However,…

2024

Toward Compositional Behavior in Neural Models: A Survey of Current Views

EMNLP 2024main

Compositionality is a core property of natural language, and compositional behavior (CB) is a crucial goal for modern NLP systems. The research literature, however, includes conflicting perspectives on how CB should be defined, evaluated, and achieved. We propose a conceptual framework to address th…

Cited by 2SourcePDFScholar
2023

Differentiable Tree Operations Promote Compositional Generalization

ICML 2023poster

In the context of structure-to-structure transformation tasks, learning sequences of discrete symbolic operations poses significant challenges due to their non-differentiability. To facilitate the learning of these symbolic sequences, we introduce a differentiable tree interpreter that compiles high…

2021

Enriching Transformers with Structured Tensor-Product Representations for Abstractive Summarization

NAACL 2021long

Abstractive summarization, the task of generating a concise summary of input documents, requires: (1) reasoning over the source document to determine the salient pieces of information scattered across the long document, and (2) composing a cohesive text by reconstructing these salient facts into a s…

2020

Mapping natural-language problems to formal-language solutions using structured neural representations

ICML 2020poster

Generating formal-language programs represented by relational tuples, such as Lisp programs or mathematical operations, to solve problems stated in natural language is a challenging task because it requires explicitly capturing discrete symbolic structural information implicit in the input. However,…

Cited by 37SourcePDFScholar
2019

RNNs implicitly implement tensor-product representations

ICLR 2019poster

Recurrent neural networks (RNNs) can learn continuous vector representations of symbolic structures such as sequences and sentences; these representations often exhibit linear regularities (analogies). Such regularities motivate our hypothesis that RNNs that show such regularities implicitly compil…