English
Related papers

Related papers: SmartThinker: Learning to Compress and Preserve Re…

200 papers

Large reasoning models (LRMs) like OpenAI o1 and DeepSeek-R1 achieve high accuracy on complex tasks by adopting long chain-of-thought (CoT) reasoning paths. However, the inherent verbosity of these processes frequently results in redundancy…

Computation and Language · Computer Science 2026-03-10 Chenzhi Hu , Qinzhe Hu , Yuhang Xu , Junyi Chen , Ruijie Wang , Shengzhong Liu , Jianxin Li , Fan Wu , Guihai Chen

Large language models (LLMs) have shown remarkable performance in complex reasoning tasks, but their efficiency is hindered by the substantial memory and computational costs associated with generating lengthy tokens. In this paper, we…

Computation and Language · Computer Science 2025-09-24 Jintian Zhang , Yuqi Zhu , Mengshu Sun , Yujie Luo , Shuofei Qiao , Lun Du , Da Zheng , Huajun Chen , Ningyu Zhang

Large Reasoning Models (LRMs) demonstrate strong performance on complex tasks but often suffer from excessive verbosity, known as "overthinking." Existing solutions via reinforcement learning (RL) typically penalize generated tokens to…

Computation and Language · Computer Science 2025-12-02 Canhui Wu , Qiong Cao , Chang Li , Zhenfang Wang , Chao Xue , Yuwei Fan , Wei Xi , Xiaodong He

Large Language Models (LLMs) using Chain-of-Thought (CoT) prompting excel at complex reasoning but generate verbose thought processes with considerable redundancy, leading to increased inference costs and reduced efficiency. We introduce a…

Artificial Intelligence · Computer Science 2026-02-17 Zeju Li , Jianyuan Zhong , Ziyang Zheng , Xiangyu Wen , Zhijian Xu , Yingying Cheng , Fan Zhang , Qiang Xu

Reasoning language models have shown an uncanny ability to improve performance at test-time by ``thinking longer''-that is, by generating longer chain-of-thought sequences and hence using more compute. However, the length of their…

Computation and Language · Computer Science 2025-10-06 Pranjal Aggarwal , Sean Welleck

Large Reasoning Models (LRMs) often suffer from overthinking, generating verbose reasoning traces that compromise both computational efficiency and interpretability. Unlike prior efforts that rely on global length-based rewards, we propose…

Artificial Intelligence · Computer Science 2026-01-07 Jialiang Hong , Taihang Zhen , Kai Chen , Jiaheng Liu , Junlan Feng , Wenpeng Zhu , Jing Huo , Yang Gao , Depeng Wang , Haitao Wan , Xi Yang , Boyan Wang , Fanyu Meng , Yuyao Zhang

Large language models (LLMs) excel at complex reasoning, yet their efficiency is limited by the surging cognitive overhead of long thought traces. In this paper, we propose LightThinker, a method that enables LLMs to dynamically compress…

Computation and Language · Computer Science 2026-04-07 Yuqi Zhu , Jintian Zhang , Zhenjie Wan , Yujie Luo , Shuofei Qiao , Zhengke Gui , Da Zheng , Lei Liang , Huajun Chen , Ningyu Zhang

Large Reasoning Models (LRMs) excel at complex tasks using Chain-of-Thought (CoT) reasoning. However, their tendency to overthinking leads to unnecessarily lengthy reasoning chains, dramatically increasing inference costs. To mitigate this…

Machine Learning · Computer Science 2025-05-26 Zigeng Chen , Xinyin Ma , Gongfan Fang , Ruonan Yu , Xinchao Wang

Recent advancements in Large Language Models (LLMs) have leveraged increased test-time computation to enhance reasoning capabilities, a strategy that, while effective, incurs significant latency and resource costs, limiting their…

Machine Learning · Computer Science 2025-09-01 Hao Wen , Xinrui Wu , Yi Sun , Feifei Zhang , Liye Chen , Jie Wang , Yunxin Liu , Yunhao Liu , Ya-Qin Zhang , Yuanchun Li

Test-time scaling has proven effective in further enhancing the performance of pretrained Large Language Models (LLMs). However, mainstream post-training methods (i.e., reinforcement learning (RL) with chain-of-thought (CoT) reasoning)…

Machine Learning · Computer Science 2025-08-19 Yuyang Xu , Yi Cheng , Haochao Ying , Zhuoyun Du , Renjun Hu , Xing Shi , Wei Lin , Jian Wu

Large Reasoning Models (LRMs) have achieved remarkable success, yet they often suffer from producing unnecessary and verbose reasoning chains. We identify a core aspect of this issue as "invalid thinking" -- models tend to repeatedly…

Artificial Intelligence · Computer Science 2025-09-12 Zhengxiang Cheng , Dongping Chen , Mingyang Fu , Tianyi Zhou

Despite the empirical success of extensive, step-by-step reasoning in large multimodal models, long reasoning processes inevitably incur substantial computational overhead, i.e., in terms of higher token costs and increased response time,…

Computer Vision and Pattern Recognition · Computer Science 2026-01-07 Ruiyang Zhang , Dongzhan Zhou , Zhedong Zheng

Large Reasoning Models (LRMs) achieve strong performance on complex tasks by leveraging long Chain-of-Thought (CoT), but often suffer from overthinking, leading to excessive reasoning steps and high inference latency. Existing CoT…

Computation and Language · Computer Science 2026-04-13 Yi Sui , Chaozhuo Li , Dawei Song

Large reasoning models trained with reinforcement learning and verifiable rewards (RLVR) achieve strong performance on complex reasoning tasks, yet often overthink, generating redundant reasoning without performance gains. Existing…

Computation and Language · Computer Science 2026-04-20 Shuaiyi Nie , Siyu Ding , Wenyuan Zhang , Linhao Yu , Tianmeng Yang , Yao Chen , Weichong Yin , Yu Sun , Hua Wu , Tingwen Liu

Large Reasoning Models (LRMs) perform strongly in complex reasoning tasks via Chain-of-Thought (CoT) prompting, but often suffer from verbose outputs, increasing computational overhead. Existing fine-tuning-based compression methods either…

Machine Learning · Computer Science 2025-09-22 Ziqing Qiao , Yongheng Deng , Jiali Zeng , Dong Wang , Lai Wei , Guanbo Wang , Fandong Meng , Jie Zhou , Ju Ren , Yaoxue Zhang

Large reasoning models (LRMs) are proficient at generating explicit, step-by-step reasoning sequences before producing final answers. However, such detailed reasoning can introduce substantial computational overhead and latency,…

Computation and Language · Computer Science 2025-10-10 Songjun Tu , Jiahao Lin , Qichao Zhang , Xiangyu Tian , Linjing Li , Xiangyuan Lan , Dongbin Zhao

Recent advances in Large Reasoning Models (LRMs) have demonstrated strong performance on complex tasks through long Chain-of-Thought (CoT) reasoning. However, their lengthy outputs increase computational costs and may lead to overthinking,…

Artificial Intelligence · Computer Science 2026-04-16 Bin Hong , Jiayu Liu , Kai Zhang , Jianwen Sun , Mengdi Zhang , Zhenya Huang

Recent advances in Chain-of-Thought (CoT) prompting have substantially improved the reasoning capabilities of Large Language Models (LLMs). However, these methods often suffer from overthinking, leading to unnecessarily lengthy or redundant…

Computation and Language · Computer Science 2025-06-13 Zhensheng Jin , Xinze Li , Yifan Ji , Chunyi Peng , Zhenghao Liu , Qi Shi , Yukun Yan , Shuo Wang , Furong Peng , Ge Yu

The reasoning capabilities of large language models (LLMs) have improved substantially through increased test-time computation, typically in the form of intermediate tokens known as chain-of-thought (CoT). However, CoT often becomes…

Computation and Language · Computer Science 2026-01-07 Nathanaël Carraz Rakotonirina , Ren Pang , Neha Anna John , Michael Bohlke-Schneider , Momchil Hardalov

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
‹ Prev 1 2 3 10 Next ›