Challenge: Large Language Models (LLMs) struggle with systematic reasoning on out-of-distribution (OOD) tasks.
Approach: They propose to use a set of constraints to measure OOD generalization to create large reasoning models that can be leveraged to solve real-world problems.
Outcome: The proposed models outperform their LLM counterparts in single-path reasoning tasks but struggle in multi-path setting.

Similar Papers

Large Language Models are few(1)-shot Table Reasoners (2023.findings-eacl)

Copied to clipboard

Challenge: Recent literature has shown that large language models are excellent few-shot reasoners to solve text reasoning tasks.
Approach: They evaluated LLMs on popular table QA and fact verification datasets like WikiTableQuestion, FetaQA, TabFact, and FEVEROUS and found they are competent at complex reasoning over table structures.
Outcome: The proposed models are more competent at complex reasoning over table structures than tuned T5-large models.
Large Reasoning Models Are (Not Yet) Multilingual Latent Reasoners (2026.findings-acl)

Copied to clipboard

Challenge: Recent work shows that large reasoning models arrive at the correct answer before completing textual reasoning steps, indicating the presence of latent reasoning.
Approach: They conduct a systematic investigation of multilingual latent reasoning in large reasoning models across 11 languages.
Outcome: The proposed model arrive at the correct answer before completing the reasoning steps, indicating the presence of latent reasoning.
There’s No Such Thing as Simple Reasoning for LLMs (2025.findings-acl)

Copied to clipboard

Challenge: Existing work has focused on relatively complex “many-hop” reasoning problems.
Approach: They analyse the performance of fine-tuned LLMs on simple reasoning problems . they find the models remain highly brittle, being susceptible to seemingly innocent perturbations .
Outcome: The proposed models fail on simple reasoning problems, but are highly brittle . they are susceptible to seemingly innocent perturbations, such as adding duplicates to the set of premises and shuffling the order in which the premises are presented.
A Systematic Analysis of Large Language Models as Soft Reasoners: The Case of Syllogistic Inferences (2024.emnlp-main)

Copied to clipboard

Challenge: syllogistic reasoning is a deductive reasoning skill that is crucial in everyday problem-solving and decision-making experiences.
Approach: They propose to study the reasoning abilities of Large Language Models (LLMs) they propose to use supervised fine-tuning and chain-of-thought reasoning to investigate their results.
Outcome: The proposed models exhibit reasoning biases, avoid answering that no conclusion follows, align with human difficulties, and struggle with multi-step reasoning.
Out-of-Context Reasoning in Large Language Models (2025.findings-emnlp)

Copied to clipboard

Challenge: a lightweight technique trains only new token embeddings on axioms and evaluates them on unseen tasks.
Approach: They propose a lightweight technique that trains only new token embeddings on axioms . they train only new embeddables and evaluate them on unseen tasks .
Outcome: The proposed technique trains only new token embeddings on axioms and evaluates them on unseen tasks.
Small Language Models Fine-tuned to Coordinate Larger Language Models improve Complex Reasoning (2023.emnlp-main)

Copied to clipboard

Challenge: Recent attempts at prompt decomposition toward solving complex, multi-step reasoning problems depend on the ability of the LLM to simultaneously decompose and solve the problem.
Approach: They propose a decomposition generator that decomposes complex problems into subproblems that require fewer reasoning steps.
Outcome: The proposed method can produce competitive or even better performance compared to its larger successor, GPT-4.
Complex Reasoning in Natural Language (2023.acl-tutorials)

Copied to clipboard

Challenge: Recent research shows that pretrained language models are often brittle for complex reasoning tasks.
Approach: They propose to use pre-trained language models to teach machines to reason over texts . they will review recent promising approaches to tackling complex reasoning tasks .
Outcome: This tutorial reviews promising approaches to complex reasoning tasks . it reviews the methods that can be used to augment models with robustness .
Large Language Models for Mathematical Reasoning: Progresses and Challenges (2024.eacl-srw)

Copied to clipboard

Challenge: a survey examines the landscape of mathematical problem-solving techniques . large language models have proven to be potent assets in unraveling nuances of mathematical reasoning .
Approach: They examine the evolution of Large Language Models (LLMs) for solving mathematical problems . they examine the spectrum of LLM-oriented techniques proposed for solving math problems - and their challenges .
Outcome: The survey examines the spectrum of proposed LLM-oriented techniques in solving math problems.
Concise and Organized Perception Facilitates Reasoning in Large Language Models (2025.findings-naacl)

Copied to clipboard

Challenge: Extensive experimental results on several popular logical benchmarks (ProofWriter, PrOntoQA, PrONtoQA-OOD, and FOLIO) and mathematical benchmark (DI-GSM) show that COP significantly outperforms previous state-of-the-art methods.
Approach: They propose a reasoning approach called Concise and Organized Perception (COP) that carefully analyzes the given statements to identify the most pertinent information while eliminating redundancy efficiently.
Outcome: The proposed approach outperforms state-of-the-art methods on several popular logical benchmarks and mathematical benchmarks.
Over-Reasoning and Redundant Calculation of Large Language Models (2024.eacl-short)

Copied to clipboard

Challenge: Large language models (LLMs) can solve problems step-by-step, but it is unclear whether they know when to use CoT and whether they are always necessary.
Approach: They propose to use LLMs to generate redundant calculations and reasoning on a manually constructed math QA dataset, GSM8K-Zero.
Outcome: The proposed model generates redundant calculations and reasoning on a manually constructed math QA dataset, but it is unclear whether it is necessary to use CoT reasoning.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations