English
Related papers

Related papers: ThinkLess: A Training-Free Inference-Efficient Met…

200 papers

Vision Language Models (VLMs) have achieved remarkable success in a wide range of vision applications of increasing complexity and scales, yet choosing the right VLM model size involves a trade-off between response quality and cost. While…

Large Language Models (LLMs) have shown remarkable performance on complex reasoning tasks, especially when equipped with long chain-of-thought (CoT) reasoning. However, eliciting long CoT typically requires large-scale reinforcement…

Computation and Language · Computer Science 2026-01-30 Huiyuan Lai , Malvina Nissim

Most vision-language models (VLMs) apply a large language model (LLM) as the decoder, where the response tokens are generated sequentially through autoregression. Therefore, the number of output tokens can be the bottleneck of the…

Computer Vision and Pattern Recognition · Computer Science 2026-04-07 Sixun Dong , Juhua Hu , Steven Li , Wei Wen , Qi Qian

Explicit Chain-of-Thought improves the reasoning performance of large language models but often incurs high inference cost due to verbose token-level traces. While recent approaches reduce this overhead via concise prompting or step…

Computation and Language · Computer Science 2026-03-09 Yunlong Chu , Minglai Shao , Yuhang Liu , Bing Hao , Yumeng Lin , Jialu Wang , Ruijie Wang

Recent Large Reasoning Models (LRMs), such as DeepSeek-R1 and OpenAI o1, have demonstrated strong performance gains by scaling up the length of Chain-of-Thought (CoT) reasoning during inference. However, a growing concern lies in their…

Large Language Models (LLMs) solve many reasoning tasks via chain-of-thought (CoT) prompting, but smaller models (about 7 to 8B parameters) still struggle with multi-step reasoning under tight compute and token budgets. Existing test time…

Computation and Language · Computer Science 2026-04-29 Sagnik Chatterjee , Atharva Patil , Sricharan Ramesh

Test-time compute has emerged as a powerful paradigm for improving the performance of large language models (LLMs), where generating multiple outputs or refining individual chains can significantly boost answer accuracy. However, existing…

Machine Learning · Computer Science 2025-09-26 Sheng Liu , Tianlang Chen , Pan Lu , Haotian Ye , Yizheng Chen , Lei Xing , James Zou

Large reasoning models (LRMs) have led to new possibilities in terms of problem-solving, through the devising of a natural language thought process prior to answering a query. While their capabilities are well known across mathematics and…

Computation and Language · Computer Science 2025-10-15 Armel Zebaze , Rachel Bawden , Benoît Sagot

Large language models (LLMs) have demonstrated remarkable capabilities in tasks requiring reasoning and multi-step problem-solving through the use of chain-of-thought (CoT) prompting. However, generating the full CoT process results in…

Computation and Language · Computer Science 2024-09-16 Tianqiao Liu , Zui Chen , Zitao Liu , Mi Tian , Weiqi Luo

In recent years, large language models (LLMs) have witnessed remarkable advancements, with the test-time scaling law consistently enhancing the reasoning capabilities. Through systematic evaluation and exploration of a diverse spectrum of…

Computation and Language · Computer Science 2025-11-03 Chenyang Shao , Sijian Ren , Fengli Xu , Yong Li

Recent advances in large language models (LLMs) have popularized the chain-of-thought (CoT) paradigm, in which models produce explicit reasoning steps in natural language. Although this approach improves interpretability and facilitates…

Computation and Language · Computer Science 2025-03-03 José I. Orlicki

Large language models (LLMs) have shown impressive capabilities in handling complex tasks through long-chain reasoning. However, the extensive reasoning steps involved can significantly increase computational costs, posing challenges for…

Computation and Language · Computer Science 2025-05-28 Yunhao Wang , Yuhao Zhang , Tinghao Yu , Can Xu , Feng Zhang , Fengzong Lian

Large Language Models (LLMs) often exhibit strong linguistic abilities while remaining unreliable on multi-step reasoning tasks, particularly when deployed without additional training or fine-tuning. In this work, we study inference-time…

Computation and Language · Computer Science 2026-03-24 Vinay Sharma , Manish Jain

Sequential test-time scaling is a promising training-free method to improve large reasoning model accuracy, but as currently implemented, significant limitations have been observed. Inducing models to think for longer can increase their…

Artificial Intelligence · Computer Science 2026-01-16 Michael R. Metel , Yufei Cui , Boxing Chen , Prasanna Parthasarathi

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

Long chain-of-thought (CoT) significantly enhances the reasoning capabilities of large language models (LLMs). However, extensive reasoning traces lead to inefficiencies and increased time-to-first-token (TTFT). We propose a training…

Computation and Language · Computer Science 2026-01-08 Roy Xie , David Qiu , Deepak Gopinath , Dong Lin , Yanchao Sun , Chong Wang , Saloni Potdar , Bhuwan Dhingra

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

Chain-of-Thought (CoT) reasoning enhances large language models (LLMs) by enabling step-by-step problem-solving, yet its extension to Long-CoT introduces substantial computational overhead due to increased token length. Existing compression…

Computation and Language · Computer Science 2025-11-14 Yibo Wang , Haotian Luo , Huanjin Yao , Tiansheng Huang , Haiying He , Rui Liu , Naiqiang Tan , Jiaxing Huang , Xiaochun Cao , Dacheng Tao , Li Shen

Latent reasoning represents a new development in Transformer language models that has shown potential in compressing reasoning lengths compared to chain-of-thought reasoning. By directly passing the information-rich previous final latent…

Machine Learning · Computer Science 2025-11-27 Alex Ning , Yen-Ling Kuo , Gabe Gomes

The scalability of large language models for long-context reasoning is severely constrained by the linear growth of their Transformer key-value cache, which incurs significant memory and computational costs. We posit that as a model…

Computation and Language · Computer Science 2025-12-30 Giovanni Monea , Yair Feldman , Shankar Padmanabhan , Kianté Brantley , Yoav Artzi