English
Related papers

Related papers: Making Small Language Models Efficient Reasoners: …

200 papers

Although LLMs have demonstrated improved performance by scaling parallel test-time compute, doing so relies on generating reasoning paths that are both diverse and accurate. For challenging problems, the forking tokens that trigger diverse…

Computation and Language · Computer Science 2026-03-03 Sheng Jia , Xiao Wang , Shiva Prasad Kasiviswanathan

Recent advances have established a new machine learning paradigm based on scaling up compute at inference time as well as at training time. In that line of work, a combination of Supervised Fine-Tuning (SFT) on synthetic demonstrations and…

Machine Learning · Computer Science 2025-07-08 Corrado Rainone , Tim Bakker , Roland Memisevic

Test-time scaling methods have seen a rapid increase in popularity for its computational efficiency and parameter-independent training to improve reasoning performance on Large Language Models. One such method is called budget forcing, a…

Artificial Intelligence · Computer Science 2025-10-27 Ravindra Aribowo Tarunokusumo , Rafael Fernandes Cunha

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 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

Test-Time Scaling (TTS) improves the reasoning performance of Large Language Models (LLMs) by allocating additional compute during inference. We conduct a structured survey of TTS methods and categorize them into sampling-based,…

Computation and Language · Computer Science 2025-06-06 Ho-Lam Chung , Teng-Yun Hsiao , Hsiao-Ying Huang , Chunerh Cho , Jian-Ren Lin , Zhang Ziwei , Yun-Nung Chen

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

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

Test-time scaling (TTS) -- the dynamic allocation of compute during inference -- is a promising direction for improving reasoning in large language models (LLMs). However, a systematic comparison of well-known TTS strategies under identical…

Computation and Language · Computer Science 2025-12-02 Aradhye Agarwal , Ayan Sengupta , Tanmoy Chakraborty

Recent advances in large language models have demonstrated that Supervised Fine-Tuning (SFT) with Chain-of-Thought (CoT) reasoning data distilled from large reasoning models (e.g., DeepSeek R1) can effectively transfer reasoning…

Computation and Language · Computer Science 2025-05-22 Bin Yu , Hang Yuan , Haotian Li , Xueyin Xu , Yuliang Wei , Bailing Wang , Weizhen Qi , Kai Chen

Large language models (LLMs) primarily rely on supervised fine-tuning (SFT) as a key method to adapt pre-trained models to domain-specific tasks such as mathematical reasoning. However, standard SFT uniformly penalizes all tokens,…

Computation and Language · Computer Science 2025-10-14 Zhiwen Ruan , Yixia Li , He Zhu , Yun Chen , Peng Li , Yang Liu , Guanhua Chen

Supervised fine-tuning (SFT) on chain-of-thought data is an essential post-training step for reasoning language models. Standard machine learning intuition suggests that training with more unique training samples yields better…

Computation and Language · Computer Science 2026-02-12 Dawid J. Kopiczko , Sagar Vaze , Tijmen Blankevoort , Yuki M. Asano

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

Reasoning Large Language Models (LLMs) enable test-time scaling, with dataset-level accuracy improving as the token budget increases, motivating adaptive reasoning -- spending tokens when they improve reliability and stopping early when…

Artificial Intelligence · Computer Science 2026-05-15 Xi Wang , Anushri Suresh , Alvin Zhang , Rishi More , William Jurayj , Benjamin Van Durme , Mehrdad Farajtabar , Daniel Khashabi , Eric Nalisnick

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

Large language models achieve breakthroughs in complex reasoning via long chain-of-thought sequences. However, this often leads to severe reasoning inflation, causing substantial computational redundancy. To maximize Intelligence per Token,…

Computation and Language · Computer Science 2026-03-19 Tingcheng Bian , Jinchang Luo , Mingquan Cheng , Jinyu Zhang , Xiaoling Xia , Ni Li , Yan Tao , Haiwei Wang

Recent breakthroughs in large language models (LLMs) have effectively improved their reasoning abilities, particularly on mathematical and logical problems that have verifiable answers, through techniques such as supervised finetuning (SFT)…

Artificial Intelligence · Computer Science 2025-06-02 Hongyi James Cai , Junlin Wang , Xiaoyin Chen , Bhuwan Dhingra

Supervised fine-tuning (SFT) has emerged as one of the most effective ways to improve the performance of large language models (LLMs) in downstream tasks. However, SFT can have difficulty generalizing when the underlying data distribution…

Computation and Language · Computer Science 2025-12-15 Mrinal Rawat , Arkajyoti Chakraborty , Neha Gupta , Roberto Pieraccini

Large reasoning models (LRMs) have exhibited remarkable reasoning capabilities through inference-time scaling, but this progress has also introduced considerable redundancy and inefficiency into their reasoning processes, resulting in…

Artificial Intelligence · Computer Science 2025-07-18 Xingyang He , Xiao Ling , Jie Liu

Test-time scaling (TTS), which involves dynamic allocation of compute during inference, offers a promising way to improve reasoning in large language models. While existing TTS methods work well, they often rely on long decoding paths or…

Computation and Language · Computer Science 2025-05-26 Aradhye Agarwal , Ayan Sengupta , Tanmoy Chakraborty
‹ Prev 1 2 3 10 Next ›