activity
20182025
most citedEnhancing the Transformer with Explicit Relational Encoding for Math Problem Solving

37 citations · 68 across the 13 of their papers we have counts for

collaborators

13 papers

cs.LG2025

TRA: Better Length Generalisation with Threshold Relative Attention

Mattia Opper, Roland Fernandez, Paul Smolensky +1

Transformers struggle with length generalisation, displaying poor performance even on basic tasks. We test whether these limitations can be explained through two key failures of th…

cs.AI2024

Compositional Generalization Across Distributional Shifts with Sparse Tree Operations

Paul Soulos, Henry Conklin, Mattia Opper +3

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 neur…

cs.AI2024

Mechanisms of Symbol Processing for In-Context Learning in Transformer Networks

Paul Smolensky, Roland Fernandez, Zhenghao Herbert Zhou +3

Large Language Models (LLMs) have demonstrated impressive abilities in symbol processing through in-context learning (ICL). This success flies in the face of decades of critiques a…

cs.CL2023★ 1 cited

Implicit Chain of Thought Reasoning via Knowledge Distillation

Yuntian Deng, Kiran Prasad, Roland Fernandez +3

To augment language models with the ability to reason, researchers usually prompt or finetune them to produce chain of thought reasoning steps before producing the final answer. Ho…

cs.CL2023★ 1 cited

Differentiable Tree Operations Promote Compositional Generalization

Paul Soulos, Edward Hu, Kate McCurdy +4

In the context of structure-to-structure transformation tasks, learning sequences of discrete symbolic operations poses significant challenges due to their non-differentiability. T…

cs.CL2022

Structural Biases for Improving Transformers on Translation into Morphologically Rich Languages

Paul Soulos, Sudha Rao, Caitlin Smith +9

Machine translation has seen rapid progress with the advent of Transformer-based models. These models have no explicit linguistic structure built into them, yet they may still impl…

cs.AI2022★ 4 cited

Neurocompositional computing: From the Central Paradox of Cognition to a new generation of AI systems

Paul Smolensky, R. Thomas McCoy, Roland Fernandez +2

What explains the dramatic progress from 20th-century to 21st-century AI, and how can the remaining limitations of current AI be overcome? The widely accepted narrative attributes…

cs.CL2021

Enriching Transformers with Structured Tensor-Product Representations for Abstractive Summarization

Yichen Jiang, Asli Celikyilmaz, Paul Smolensky +7

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 informat…

cs.LG2021★ 21 cited

Compositional Processing Emerges in Neural Networks Solving Math Problems

Jacob Russin, Roland Fernandez, Hamid Palangi +4

A longstanding question in cognitive science concerns the learning mechanisms underlying compositionality in human cognition. Humans can infer the structured relationships (e.g., g…

cs.CV2020★ 1 cited

Neuro-Symbolic Representations for Video Captioning: A Case for Leveraging Inductive Biases for Vision and Language

Hassan Akbari, Hamid Palangi, Jianwei Yang +6

Neuro-symbolic representations have proved effective in learning structure information in vision and language. In this paper, we propose a new model architecture for learning multi…

cs.LG2019★ 1 cited

Working Memory Graphs

Ricky Loynd, Roland Fernandez, Asli Celikyilmaz +2

Transformers have increasingly outperformed gated RNNs in obtaining new state-of-the-art results on supervised tasks involving text sequences. Inspired by this trend, we study the…

cs.LG2019★ 37 cited

Enhancing the Transformer with Explicit Relational Encoding for Math Problem Solving

Imanol Schlag, Paul Smolensky, Roland Fernandez +3

We incorporate Tensor-Product Representations within the Transformer in order to better support the explicit representation of relation structure. Our Tensor-Product Transformer (T…

cs.AI2018★ 2 cited

Learning and analyzing vector encoding of symbolic representations

Roland Fernandez, Asli Celikyilmaz, Rishabh Singh +1

We present a formal language with expressions denoting general symbol structures and queries which access information in those structures. A sequence-to-sequence network processing…