English
Related papers

Related papers: Beyond Dense States: Elevating Sparse Transcoders …

200 papers

Recent large reasoning models such as DeepSeek-R1 exhibit strong complex problems solving abilities by generating long chain-of-thought (CoT) reasoning steps. It is challenging to directly train small language models (SLMs) to emerge long…

Computation and Language · Computer Science 2025-06-19 Zhaoyang Wang , Jinqi Jiang , Tian Qiu , Hui Liu , Xianfeng Tang , Huaxiu Yao

Looped Language Models (LoopLMs) perform multi-step latent reasoning prior to token generation and outperform conventional LLMs on reasoning benchmarks at smaller parameter budgets. However, attempts to further improve LoopLM reasoning with…

Machine Learning · Computer Science 2026-05-29 Jonathan Williams , Esin Tureci

Chain-of-Thought (CoT) prompting is a key technique for enabling complex reasoning in large language models. However, generating full, fixed-length rationales is computationally wasteful, inflating both token usage and latency. We introduce…

Computation and Language · Computer Science 2025-11-07 Mohammad Atif Quamar , Mohammad Areeb

Recent research enhances language model reasoning by scaling test-time compute via longer chain-of-thought traces. This often improves accuracy but also introduces redundancy and high computational cost, especially for small language models…

Machine Learning · Computer Science 2025-05-26 Xuechen Zhang , Zijian Huang , Chenshun Ni , Ziyang Xiong , Jiasi Chen , Samet Oymak

Chain-of-Thought (CoT) reasoning enhances Large Language Models (LLMs) by encouraging step-by-step reasoning in natural language. However, leveraging a latent continuous space for reasoning may offer benefits in terms of both efficiency and…

Computation and Language · Computer Science 2025-09-24 Zhenyi Shen , Hanqi Yan , Linhai Zhang , Zhanghao Hu , Yali Du , Yulan He

Scientific measurements are often bottlenecked by suboptimal conditions, whether that be noise, incomplete spatial coverage, or limited resolution, rendering accurate field reconstruction a difficult task. We introduce LatentPDE, a latent…

Machine Learning · Computer Science 2026-04-28 Valerie Tsao , Nathaniel Chaney , Manolis Veveakis

Standard Transformers have a fixed computational depth, fundamentally limiting their ability to generalize to tasks requiring variable-depth reasoning, such as multi-hop graph traversal or nested logic. We propose a depth-recurrent…

Machine Learning · Computer Science 2026-03-24 Hung-Hsuan Chen

Large Language Models (LLMs) are traditionally viewed as black-box algorithms, therefore reducing trustworthiness and obscuring potential approaches to increasing performance on downstream tasks. In this work, we apply an effective LLM…

Computation and Language · Computer Science 2025-07-10 Shun Wang , Tyler Loakman , Youbo Lei , Yi Liu , Bohao Yang , Yuting Zhao , Dong Yang , Chenghua Lin

Looped Language Models (LoopLMs) enable efficient latent reasoning through depth recurrence, yet exhibit unreliable test-time scaling behavior: performance often peaks at a certain iteration depth and then collapses with further recurrence.…

Machine Learning · Computer Science 2026-05-27 Xiao-Wen Yang , Ziyu Han , Xi-Hua Zhang , Wen-Da Wei , Jie-Jing Shao , Lan-Zhe Guo , Yu-Feng Li

Modern LLMs are trained to "think" primarily via explicit text generation, such as chain-of-thought (CoT), which defers reasoning to post-training and under-leverages pre-training data. We present and open-source Ouro, named after the…

While Transformer architectures have demonstrated impressive scalability across domains, they continue to face challenges in long-context reasoning, computational efficiency, and structural generalization - largely due to rigid layer…

Computation and Language · Computer Science 2025-10-03 Haochen You , Baojing Liu

Large Language Models (LLMs) have shown impressive capabilities in complex reasoning tasks. However, current approaches employ uniform language density for both intermediate reasoning and final answers, leading to computational…

Computation and Language · Computer Science 2025-12-18 Zhengyi Zhao , Shubo Zhang , Yuxi Zhang , Huimin Wang , Binyang Li , Kam-Fai Wong

Despite their strong performance, Dense Passage Retrieval (DPR) models suffer from a lack of interpretability. In this work, we propose a novel interpretability framework that leverages Sparse Autoencoders (SAEs) to decompose previously…

Information Retrieval · Computer Science 2025-08-28 Seongwan Park , Taeklim Kim , Youngjoong Ko

Large language models (LLMs) solve complex problems by generating multi-step reasoning traces. Yet these traces are typically analyzed from only one of two perspectives: the sequence of tokens across different reasoning steps in the…

Computation and Language · Computer Science 2026-03-25 Ruidi Chang , Jiawei Zhou , Hanjie Chen

Recent work shows that, beyond discrete reasoning through explicit chain-of-thought steps, which are limited by the boundaries of natural languages, large language models (LLMs) can also reason continuously in latent space, allowing richer…

Computation and Language · Computer Science 2026-03-03 Dachuan Shi , Abedelkadir Asi , Keying Li , Xiangchi Yuan , Leyan Pan , Wenke Lee , Wen Xiao

Single-step retrieval-augmented generation (RAG) provides an efficient way to incorporate external information for simple question answering tasks but struggles with complex questions. Agentic RAG extends this paradigm by replacing…

Computation and Language · Computer Science 2026-05-08 Yijia Zheng , Marcel Worring

Large language models (LLMs) are typically constrained to reason in the language space, where they express the reasoning process through a chain-of-thought (CoT) to solve complex problems. However, the language space may not always be…

Computation and Language · Computer Science 2025-11-04 Shibo Hao , Sainbayar Sukhbaatar , DiJia Su , Xian Li , Zhiting Hu , Jason Weston , Yuandong Tian

Large language models (LLMs) are often constrained by rigid reasoning processes, limiting their ability to generate creative and diverse responses. To address this, a novel framework called LADDER is proposed, combining Chain-of-Thought…

Computation and Language · Computer Science 2025-06-17 Xintong Tang , Meiru Zhang , Shang Xiao , Junzhao Jin , Zihan Zhao , Liwei Li , Yang Zheng , Bangyi Wu

Chain-of-thought (CoT) prompting improves LLM reasoning but incurs high latency and memory cost due to verbose traces, motivating CoT compression with preserved correctness. Existing methods either shorten CoTs at the semantic level, which…

Artificial Intelligence · Computer Science 2026-01-29 Zhenxuan Fan , Jie Cao , Yang Dai , Zheqi Lv , Wenqiao Zhang , Zhongle Xie , Peng LU , Beng Chin Ooi

Text Style Transfer (TST) seeks to alter the style of text while retaining its core content. Given the constraints of limited parallel datasets for TST, we propose CoTeX, a framework that leverages large language models (LLMs) alongside…

Computation and Language · Computer Science 2024-05-07 Chiyu Zhang , Honglong Cai , Yuezhang , Li , Yuexin Wu , Le Hou , Muhammad Abdul-Mageed