Enhancing Transformers for Generalizable First-Order Logical Entailment (2025.acl-long)
Copied to clipboard
Tianshi Zheng, Jiazheng Wang, Zihao Wang, Jiaxin Bai, Hang Yin, Zheye Deng, Yangqiu Song, Jianxin Li
| Challenge: | Moreover, transformers have demonstrated proficiency in logical reasoning over natural language. |
| Approach: | They propose a logic-aware architecture that improves the performance in generalizable first-order logical entailment by combining distribution shifts and unseen knowledge. |
| Outcome: | The proposed architecture outperforms methods designed specifically for knowledge graph query answering on a dataset with a large dataset. |
Similar Papers
Unravelling the Logic: Investigating the Generalisation of Transformers in Numerical Satisfiability Problems (2025.acl-long)
Copied to clipboard
| Challenge: | Transformer models exhibit minimal scale and noise invariance, along with limited vocabulary and number invariancy. |
| Approach: | They probe the generalisation prowess of Transformer models with respect to the hitherto unexplored domain of numerical satisfiability problems. |
| Outcome: | The proposed models exhibit minimal scale and noise invariance, along with limited vocabulary and number invariancy. |
It is not True that Transformers are Inductive Learners: Probing NLI Models with External Negation (2024.eacl-long)
Copied to clipboard
| Challenge: | et al., 2017) show that NLI models learn to treat external negation as a distractor . e-learning models fail to inductively learn the role of negation for NLI tasks . |
| Approach: | They propose that models fine-tuned on NLI datasets learn to treat external negation as a distractor, effectively ignoring its presence in hypothesis sentences. |
| Outcome: | The proposed models learn to treat external negation as a distractor, the authors show . they also fail to inductively learn the law of the excluded middle for a single prefix . |
Investigating Transformer-Guided Chaining for Interpretable Natural Logic Reasoning (2023.findings-acl)
Copied to clipboard
| Challenge: | Natural logic reasoning has received increasing attention lately, with several datasets and neural models proposed, though with limited success. |
| Approach: | They propose to iteratively perform 1-step neural inferences and chain together the results to generate a multi-step reasoning trace. |
| Outcome: | The proposed method has high accuracies on a multi-hop First-Order Logic (FOL) reasoning benchmark. |
Is Grokking Worthwhile? Functional Analysis and Transferability of Generalization Circuits in Transformers (2026.findings-acl)
Copied to clipboard
| Challenge: | Large Language Models struggle with the "curse of two-hop reasoning" in compositional tasks. |
| Approach: | They propose to form a "Generalization Circuit" during a prolonged "grokking" phase . they argue that grokkking is the process of integrating memorized atomic facts into an easy-acquire reasoning path. |
| Outcome: | The proposed model is superior to non-grokked models, but it requires a large computational cost . the study shows that grokking is not the sudden acquisition of a new reasoning paradigm . |
Learning Semantic Structure through First-Order-Logic Translation (2024.findings-emnlp)
Copied to clipboard
| Challenge: | a recent study shows that transformer-based language models can confuse which predicates apply to which objects . a this is a crucial building block of semantic structure, but if an LM mixes up which objects have which property, it makes errors in reasoning . |
| Approach: | They propose to use transformer-based language models to learn predicate argument structure from simple sentences. |
| Outcome: | The proposed model can learn predicate argument structure from simple sentences. |
Optimizing Deeper Transformers on Small Datasets (2021.acl-long)
Copied to clipboard
Peng Xu, Dhruv Kumar, Wei Yang, Wenjie Zi, Keyi Tang, Chenyang Huang, Jackie Chi Kit Cheung, Simon J.D. Prince, Yanshuai Cao
| Challenge: | a common belief that training deep transformers from scratch requires large datasets is wrong . however, with proper initialization and optimization, the benefits of very deep transformer can carry over to challenging tasks with small datasets. |
| Approach: | They train 48 layers of transformers from pre-trained RoBERTa and 24 relation-aware layers from scratch. |
| Outcome: | The proposed scheme achieves state-of-the-art performance on a text-to-sql parsing benchmark . it uses 24 fine-tuned layers from pre-trained RoBERTa and 24 relation-aware layers from scratch . |
PRover: Proof Generation for Interpretable Reasoning over Rules (2020.emnlp-main)
Copied to clipboard
| Challenge: | Recent work shows that transformers can act as “soft theorem provers” by answering questions over explicitly provided knowledge in natural language. |
| Approach: | They propose a transformer-based model that answers binary questions over rule-bases and generates the corresponding proofs. |
| Outcome: | The proposed model generates proofs with an accuracy of 87% while maintaining or improving performance on the QA task. |
Learning Syntax Without Planting Trees: Understanding Hierarchical Generalization in Transformers (2025.tacl-1)
Copied to clipboard
Kabir Ahuja, Vidhisha Balachandran, Madhur Panwar, Tianxing He, Noah A. Smith, Navin Goyal, Yulia Tsvetkov
| Challenge: | Inductive biases in transformers can cause hierarchical generalization without explicitly encoding structural bias. |
| Approach: | They investigate sources of inductive bias in transformer models and their training that could cause such preference for hierarchical generalization. |
| Outcome: | The proposed model can generalize to novel syntactic forms without explicit bias . the proposed model is able to generalize on a dataset with a hierarchical grammar . |
When Can Transformers Ground and Compose: Insights from Compositional Generalization Benchmarks (2022.emnlp-main)
Copied to clipboard
| Challenge: | Recent benchmarks like ReaSCAN use navigation tasks grounded in a grid world to assess whether neural models exhibit compositional behaviour. |
| Approach: | They propose a transformer-based model that outperforms specialized architectures on ReaSCAN and a modified version of gSCAN to test their performance. |
| Outcome: | The proposed model outperforms specialized architectures on ReaSCAN and gSCAN on a grid world and can generalize to deeper input structures. |
Logical Transformers: Infusing Logical Structures into Pre-Trained Language Models (2023.findings-acl)
Copied to clipboard
Borui Wang, Qiuyuan Huang, Budhaditya Deb, Aaron Halfaker, Liqun Shao, Daniel McDuff, Ahmed Hassan Awadallah, Dragomir Radev, Jianfeng Gao
| Challenge: | Existing pre-trained language models that ignore the logical structures underlying natural language text often lack the ability to capture and encode key logical information in the input sequences. |
| Approach: | They propose to construct logic-aware input embeddings for transformer language models through logic detection, logic mapping and hierarchical logical projections and then develop a new modeling paradigm that can upgrade existing transformer language model into logical transformers to boost their performance. |
| Outcome: | The proposed model can achieve superior performance on four important and challenging tasks. |