中文
相关论文

相关论文: The Path of Least Resistance: Guiding LLM Reasonin…

200 篇论文

To enhance the reasoning capabilities of large language models (LLMs), self-consistency has become a popular approach, combining multiple samplings with majority voting. However, current methods are computationally expensive and…

计算与语言 · 计算机科学 2025-11-05 Jiace Zhu , Yuanzhe Huang , Yingtao Shen , Jie Zhao , An Zou

Capturing complex user preferences from sparse behavioral sequences remains a fundamental challenge in sequential recommendation. Recent latent reasoning methods have shown promise by extending test-time computation through multi-step…

信息检索 · 计算机科学 2026-01-07 Jiakai Tang , Xu Chen , Wen Chen , Jian Wu , Yuning Jiang , Bo Zheng

Reinforcement Learning with Verifiable Rewards (RLVR) significantly enhances the reasoning capability of Large Language Models (LLMs). Current RLVR approaches typically conduct training across all generated tokens, but neglect to explore…

计算与语言 · 计算机科学 2025-12-18 Yiliu Sun , Zicheng Zhao , Yang Wei , Yanfang Zhang , Chen Gong

Reasoning models improve their problem-solving ability through inference-time scaling, allocating more compute via longer token budgets. Identifying which reasoning traces are likely to succeed remains a key opportunity: reliably predicting…

人工智能 · 计算机科学 2025-10-14 Martina G. Vilas , Safoora Yousefi , Besmira Nushi , Eric Horvitz , Vidhisha Balachandran

Recent advancements in large language models (LLMs) integrating explicit reasoning, such as OpenAI's o3-mini, DeepSeek-R1, and QWQ-32B, enable smaller models to solve complex tasks by generating intermediate reasoning steps prior to…

机器学习 · 计算机科学 2025-03-25 Jaeyeon Lee , Guantong Qi , Matthew Brady Neeley , Zhandong Liu , Hyun-Hwan Jeong

Chain-of-thought (CoT) prompting enhances reasoning in large language models (LLMs) but often leads to verbose and redundant outputs, thus increasing inference cost. We hypothesize that many reasoning steps are unnecessary for producing…

计算与语言 · 计算机科学 2025-09-30 Xin Liu , Lu Wang

Large Language Models (LLMs) achieve superior performance through Chain-of-Thought (CoT) reasoning, but these token-level reasoning chains are computationally expensive and inefficient. In this paper, we introduce Compressed Latent…

计算与语言 · 计算机科学 2026-02-04 Wenhui Tan , Jiaze Li , Jianzhong Ju , Zhenbo Luo , Ruihua Song , Jian Luan

Recent reasoning-focused language models achieve high accuracy by generating lengthy intermediate reasoning paths before producing final answers. While this approach is effective in solving problems that require logical thinking, long…

计算与语言 · 计算机科学 2025-10-27 Jiwon Song , Dongwon Jo , Yulhwa Kim , Jae-Joon Kim

Large language models (LLMs) now exhibit strong multi-step reasoning abilities, but existing inference-time scaling methods remain computationally expensive, often relying on extensive sampling or external evaluators. We propose a…

人工智能 · 计算机科学 2026-03-10 Nicolas Legrand , Kenneth Enevoldsen , Márton Kardos , Kristoffer Nielbo

Language Reasoning Models (LRMs) achieve strong performance by scaling test-time computation but often suffer from ``overthinking'', producing excessively long reasoning traces that increase latency and memory usage. Existing LRMs typically…

The Chain-of-Thought (CoT) paradigm, while enhancing the interpretability of Large Language Models (LLMs), is constrained by the inefficiencies and expressive limits of natural language. Latent Chain-of-Thought (latent CoT) reasoning, which…

计算与语言 · 计算机科学 2026-05-12 Xiaocheng Luo , Kang Wang , Zaifu Zhan , Yuechi Zhou , Xiangyu Duan

Explicit chain-of-thought (CoT) reasoning substantially improves the reasoning ability of large language models (LLMs), but incurs high inference cost due to lengthy autoregressive traces. Existing latent reasoning methods offer a promising…

计算与语言 · 计算机科学 2026-05-26 Hui Xie , Jie Liu , Ziyue Qiao , Joaquin Vanschore

Recent advances in natural language processing highlight two key factors for improving reasoning in large language models (LLMs): (i) allocating more test-time compute tends to help on harder problems but often introduces redundancy in the…

计算与语言 · 计算机科学 2025-11-04 Riccardo Alberghi , Elizaveta Demyanenko , Luca Biggio , Luca Saglietti

Preference optimization methods have been successfully applied to improve not only the alignment of large language models (LLMs) with human values, but also specific natural language tasks such as summarization and stylistic continuations.…

机器学习 · 计算机科学 2025-02-06 Salem Lahlou , Abdalgader Abubaker , Hakim Hacid

Large Language Models (LLMs) are increasingly relied upon for solving complex reasoning tasks in domains such as mathematics, logic, and multi-step question answering. A growing line of work seeks to improve reasoning quality by scaling…

机器学习 · 计算机科学 2025-08-05 Seyyed Saeid Cheshmi , Azal Ahmad Khan , Xinran Wang , Zirui Liu , Ali Anwar

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

机器学习 · 计算机科学 2025-08-19 Yuyang Xu , Yi Cheng , Haochao Ying , Zhuoyun Du , Renjun Hu , Xing Shi , Wei Lin , Jian Wu

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…

计算与语言 · 计算机科学 2026-03-24 Vinay Sharma , Manish Jain

Large Language Models (LLMs) have demonstrated powerful reasoning capabilities through Chain-of-Thought (CoT) in various tasks, yet the inefficiency of token-by-token generation hinders real-world deployment in latency-sensitive recommender…

Chain-of-Thought (CoT) has become a cornerstone of reasoning in large language models, yet its effectiveness is constrained by the limited expressiveness of discrete token sampling. Recent latent reasoning approaches attempt to alleviate…

计算与语言 · 计算机科学 2026-04-21 Renyu Fu , Guibo Luo

Parallel reasoning enhances Large Reasoning Models (LRMs) but incurs prohibitive costs due to futile paths caused by early errors. To mitigate this, path pruning at the prefix level is essential, yet existing research remains fragmented…

计算与语言 · 计算机科学 2026-04-20 Jiaxi Bi , Tongxu Luo , Wenyu Du , Zhengyang Tang , Benyou Wang
‹ 上一页 1 2 3 10 下一页 ›