English
Related papers

Related papers: Limit Analysis for Symbolic Multi-step Reasoning T…

200 papers

Transformer-based language models have achieved impressive success in various natural language processing tasks due to their ability to capture complex dependencies and contextual information using self-attention mechanisms. However, they…

Computation and Language · Computer Science 2023-06-26 Kaushik Roy , Yuxin Zi , Vignesh Narayanan , Manas Gaur , Amit Sheth

What happens when a language model thinks without words? Standard reasoning LLMs verbalize intermediate steps as chain-of-thought; latent reasoning transformers (LRTs) instead perform deliberation entirely in continuous hidden space. We…

Computation and Language · Computer Science 2026-02-10 Jasmine Cui , Charles Ye

Due to their inherent complexity, reasoning tasks have long been regarded as rigorous benchmarks for assessing the capabilities of machine learning models, especially large language models (LLMs). Although humans can solve these tasks with…

Artificial Intelligence · Computer Science 2026-03-30 Yunlong Deng , Boyang Sun , Yan Li , Lingjing Kong , Zeyu Tang , Kun Zhang , Guangyi Chen

In this paper, we introduce a nonlinear stochastic model to describe the propagation of information inside a computer processor. In this model, a computational task is divided into stages, and information can flow from one stage to another.…

Probability · Mathematics 2024-11-26 Mohammad Daneshvar , Richard C. Barnard , Cory Hauck , Ilya Timofeyev

One way to interpret the reasoning power of transformer-based language models is to describe the types of logical rules they can resolve over some input text. Recently, Chiang et al. (2023) showed that finite-precision transformers can be…

Machine Learning · Computer Science 2025-09-12 William Merrill , Ashish Sabharwal

LLMs can solve complex tasks by generating long, multi-step reasoning chains. Test-time scaling (TTS) can further improve performance by sampling multiple variants of intermediate reasoning steps, verifying their correctness, and selecting…

We present a systematic review of 337 articles evaluating the syntactic abilities of Transformer-based language models (TLMs), reporting on over 3,000 datapoints spanning a wide range of syntactic phenomena, languages, models, and methods.…

Computation and Language · Computer Science 2026-05-28 Nora Graichen , Iria de-Dios-Flores , Gemma Boleda

Large Language Models (LLMs) have demonstrated remarkable performance in many applications, including challenging reasoning problems via chain-of-thoughts (CoTs) techniques that generate ``thinking tokens'' before answering the questions.…

Machine Learning · Computer Science 2025-11-04 Hanlin Zhu , Shibo Hao , Zhiting Hu , Jiantao Jiao , Stuart Russell , Yuandong Tian

Reasoning LLMs are trained to verbalize their reasoning process, yielding strong gains on complex tasks. This transparency also opens a promising direction: multiple reasoners can directly collaborate on each other's thinking within a…

Artificial Intelligence · Computer Science 2026-03-04 Aochong Oliver Li , Tanya Goyal

Transformer models cannot easily scale to long sequences due to their O(N^2) time and space complexity. This has led to Transformer variants seeking to lower computational complexity, such as Longformer and Performer. While such models have…

Computation and Language · Computer Science 2024-12-10 Guanghui Qin , Yukun Feng , Benjamin Van Durme

Mathematical reasoning has been challenging for large language models (LLMs), and the introduction of step-by-step Chain-of-Thought (CoT) inference has significantly advanced the mathematical capabilities of LLMs. However, current…

Artificial Intelligence · Computer Science 2025-09-23 Lang Cao , Yingtian Zou , Chao Peng , Renhong Chen , Wu Ning , Yitong Li

Large Language Models (LLMs) still struggle with multi-step logical reasoning. Existing approaches either purely refine the reasoning chain in natural language form or attach a symbolic solver as an external module. In this work, we instead…

Computation and Language · Computer Science 2026-04-22 Feihao Fang , My T. Thai , Yuanyuan Lei

Pre-trained language models (LMs) have shown remarkable reasoning performance using explanations or chain-of-thoughts (CoT)) for in-context learning. On the other hand, these reasoning tasks are usually presumed to be more approachable for…

Computation and Language · Computer Science 2024-03-29 Yi-Fan Zhang , Hanlin Zhang , Li Erran Li , Eric Xing

Large language models (LLMs) with reasoning capabilities have fueled a compelling narrative that reasoning universally improves performance across language tasks. We test this claim through a comprehensive evaluation of 504 configurations…

Computation and Language · Computer Science 2026-03-02 Donghao Huang , Zhaoxia Wang

Mechanistic interpretability aims to reverse-engineer large language models (LLMs) into human-understandable computational circuits. However, the complexity of pretrained models often obscures the minimal mechanisms required for specific…

Computation and Language · Computer Science 2025-10-30 Rabin Adhikari

In-context learning has been recognized as a key factor in the success of Large Language Models (LLMs). It refers to the model's ability to learn patterns on the fly from provided in-context examples in the prompt during inference. Previous…

Machine Learning · Computer Science 2025-03-04 Bo Chen , Xiaoyu Li , Yingyu Liang , Zhenmei Shi , Zhao Song

Users interacting with voice assistants today need to phrase their requests in a very specific manner to elicit an appropriate response. This limits the user experience, and is partly due to the lack of reasoning capabilities of dialogue…

Computation and Language · Computer Science 2022-03-22 Yi-Lin Tuan , Sajjad Beygi , Maryam Fazel-Zarandi , Qiaozi Gao , Alessandra Cervone , William Yang Wang

Large Language Models (LLMs) have benefited enormously from scaling, yet these gains are bounded by five fundamental limitations: (1) hallucination, (2) context compression, (3) reasoning degradation, (4) retrieval fragility, and (5)…

Implicit reasoning is the ability of a language model to solve multi-hop reasoning tasks in a single forward pass, without chain of thought. We investigate this capability using GPT2-style language models trained from scratch on controlled…

Computation and Language · Computer Science 2026-02-05 Yuekun Yao , Yupei Du , Dawei Zhu , Michael Hahn , Alexander Koller

Interpretability methods aim to understand the algorithm implemented by a trained model (e.g., a Transofmer) by examining various aspects of the model, such as the weight matrices or the attention patterns. In this work, through a…

Machine Learning · Computer Science 2023-12-05 Kaiyue Wen , Yuchen Li , Bingbin Liu , Andrej Risteski
‹ Prev 1 8 9 10 Next ›