English
Related papers

Related papers: Implicit Reasoning in Transformers is Reasoning th…

200 papers

Reasoning is a core capability of large language models, yet how multi-step reasoning is learned and executed remains unclear. We study this question in a controlled cellular-automata (1dCA) framework that excludes memorisation by using…

Transformer language models are neural networks used for a wide variety of tasks concerning natural language, including some that also require logical reasoning. However, a transformer model may easily learn spurious patterns in the data,…

Machine Learning · Computer Science 2024-03-20 Daniel Enström , Viktor Kjellberg , Moa Johansson

Implicit biases refer to automatic mental processes that shape perceptions, judgments, and behaviors. Previous research on "implicit bias" in LLMs focused primarily on outputs rather than the processes underlying the outputs. We present the…

Computers and Society · Computer Science 2026-04-07 Messi H. J. Lee , Calvin K. Lai

Reasoning models improve their problem-solving ability through inference-time scaling, allocating more compute via longer token budgets. Identifying which reasoning traces are likely to succeed remains a key opportunity: reliably predicting…

Artificial Intelligence · Computer Science 2025-10-14 Martina G. Vilas , Safoora Yousefi , Besmira Nushi , Eric Horvitz , Vidhisha Balachandran

Large language models excel on static benchmarks, but their ability as self-learning agents in dynamic environments remains unclear. We evaluate three prompting strategies: self-reflection, heuristic mutation, and planning across dynamic…

Artificial Intelligence · Computer Science 2025-08-12 Annie Wong , Thomas Bäck , Aske Plaat , Niki van Stein , Anna V. Kononova

Recent advancements in the field of large language models, particularly through the Chain of Thought (CoT) approach, have demonstrated significant improvements in solving complex problems. However, existing models either tend to sacrifice…

Computation and Language · Computer Science 2025-12-30 Yijiong Yu

We conduct a preliminary inquiry into the ability of generative transformer models to deductively reason from premises provided. We observe notable differences in the performance of models coming from different training setups and find that…

Computation and Language · Computer Science 2023-06-05 Peter Belcak , Luca A. Lanzendörfer , Roger Wattenhofer

Despite the remarkable successes of large language models (LLMs), the underlying Transformer architecture has inherent limitations in handling complex reasoning tasks. Chain-of-thought (CoT) prompting has emerged as a practical workaround,…

Computation and Language · Computer Science 2025-06-03 Xiang Zhang , Juntai Cao , Jiaqi Wei , Chenyu You , Dujian Ding

Looped Transformers have emerged as an efficient and powerful class of models for reasoning in the language domain. Recent studies show that these models achieve strong performance on algorithmic and reasoning tasks, suggesting that looped…

Computation and Language · Computer Science 2026-02-13 Ahmadreza Jeddi , Marco Ciccone , Babak Taati

Humans have a powerful and mysterious capacity to reason. Working through a set of mental steps enables us to make inferences we would not be capable of making directly even though we get no additional data from the world. Similarly, when…

Artificial Intelligence · Computer Science 2023-11-06 Ben Prystawski , Michael Y. Li , Noah D. Goodman

Chain of Thought (CoT) prompting can encourage language models to engage in multi-step logical reasoning. The quality of the provided demonstrations significantly influences the success of downstream inference tasks. Current unsupervised…

Computation and Language · Computer Science 2025-05-27 Yufeng Zhang , Xuepeng Wang , Lingxiang Wu , Jinqiao Wang

Shortcut reasoning is an irrational process of inference, which degrades the robustness of an NLP model. While a number of previous work has tackled the identification of shortcut reasoning, there are still two major limitations: (i) a…

Computation and Language · Computer Science 2023-12-18 Daichi Haraguchi , Kiyoaki Shirai , Naoya Inoue , Natthawut Kertkeidkachorn

Recently, small models with latent recursion have obtained promising results on complex reasoning tasks. These results are typically explained by the theory that such recursion increases a networks depth, allowing it to compactly emulate…

Computation and Language · Computer Science 2026-02-06 Arip Asadulaev , Rayan Banerjee , Fakhri Karray , Martin Takac

Large reasoning models (LRMs) achieve strong performance on mathematical reasoning tasks, often attributed to their capability to generate explicit chain-of-thought (CoT) explanations. However, recent work shows that LRMs often arrive at…

Computation and Language · Computer Science 2026-04-20 Yihong Liu , Raoyuan Zhao , Hinrich Schütze , Michael A. Hedderich

Chain-of-Thought (CoT) prompting has improved the reasoning performance of large language models (LLMs), but it remains unclear why it works and whether it is the unique mechanism for triggering reasoning in large language models. In this…

Computation and Language · Computer Science 2026-01-14 Zhenghao He , Guangzhi Xiong , Bohan Liu , Sanchit Sinha , Aidong Zhang

Language models have demonstrated remarkable performance in solving reasoning tasks; however, even the strongest models still occasionally make reasoning mistakes. Recently, there has been active research aimed at improving reasoning…

Computation and Language · Computer Science 2024-08-30 Tian Ye , Zicheng Xu , Yuanzhi Li , Zeyuan Allen-Zhu

Although most of the automated theorem-proving approaches depend on formal proof systems, informal theorem proving can align better with large language models' (LLMs) strength in natural language processing. In this work, we identify a…

Artificial Intelligence · Computer Science 2026-04-20 Yunhe Li , Hao Shi , Bowen Deng , Wei Wang , Mengzhe Ruan , Hanxu Hou , Zhongxiang Dai , Siyang Gao , Chao Wang , Shuang Qiu , Linqi Song

We study implicit reasoning, i.e. the ability to combine knowledge or rules within a single forward pass. While transformer-based large language models store substantial factual knowledge and rules, they often fail to compose this knowledge…

Computation and Language · Computer Science 2026-04-10 Harsh Kohli , Srinivasan Parthasarathy , Huan Sun , Yuekun Yao

Drawing on constructs from psychology, prior work has identified a distinction between explicit and implicit bias in large language models (LLMs). While many LLMs undergo post-training alignment and safety procedures to avoid expressions of…

Computers and Society · Computer Science 2026-02-05 Molly Apsel , Michael N. Jones

Transformers have demonstrated remarkable performance in natural language processing and related domains, as they largely focus on sequential, autoregressive next-token prediction tasks. Yet, they struggle in logical reasoning, not…

Artificial Intelligence · Computer Science 2025-10-08 Renee Ge , Qianli Liao , Tomaso Poggio