English
Related papers

Related papers: Inference-Time Chain-of-Thought Pruning with Laten…

200 papers

Inference-time scaling enhances the reasoning ability of a language model (LM) by extending its chain-of-thought (CoT). However, existing approaches typically generate the entire reasoning chain in a single forward pass, which often leads…

Computation and Language · Computer Science 2025-10-20 Siheng Xiong , Ali Payani , Faramarz Fekri

Inference-time computation is a powerful paradigm to enhance the performance of large language models (LLMs), with Best-of-N sampling being a widely used technique. However, this method is computationally expensive, requiring both (1) an…

Computation and Language · Computer Science 2024-10-04 Rohin Manvi , Anikait Singh , Stefano Ermon

Pruning has emerged as a promising direction for accelerating large language model (LLM) inference, yet existing approaches often suffer from instability because they rely on offline calibration data that may not generalize across inputs.…

Computation and Language · Computer Science 2025-12-09 Jungmin Lee , Gwangeun Byeon , Yulhwa Kim , Seokin Hong

Large language models (LLMs) demonstrate exceptional performance across a variety of tasks, yet they are often affected by hallucinations and the timeliness of knowledge. Leveraging knowledge graphs (KGs) as external knowledge sources has…

Computation and Language · Computer Science 2024-12-31 Siyuan Fang , Kaijing Ma , Tianyu Zheng , Xinrun Du , Ningxuan Lu , Ge Zhang , Qingkun Tang

Recently, large language models (LLMs) have demonstrated superior performance across various tasks by adhering to scaling laws, which significantly increase model size. However, the huge computation overhead during inference hinders the…

Computation and Language · Computer Science 2024-12-17 Zekai Li , Jintu Zheng , Ji Liu , Han Liu , Haowei Zhu , Zeping Li , Fuwei Yang , Haiduo Huang , Jinzhang Peng , Dong Li , Lu Tian , Emad Barsoum

Recent studies have indicated that effectively utilizing inference-time compute is crucial for attaining better performance from large language models (LLMs). In this work, we propose a novel inference-aware fine-tuning paradigm, in which…

Reasoning LLMs (RLMs) such as OpenAI o1, DeepSeek-R1, and Qwen3 deliver strong multi-step reasoning through chain-of-thought generation, but their large model sizes and lengthy decode-time outputs make them costly to deploy and unsuitable…

Computation and Language · Computer Science 2025-12-03 Ziyan Wang , Enmao Diao , Qi Le , Pu Wang , Guanchu Wang , Minwoo Lee , Shu-ping Yeh , Li Yang

The deployment of large language models (LLMs) is often constrained by their substantial computational and memory demands. While structured pruning presents a viable approach by eliminating entire network components, existing methods suffer…

Machine Learning · Computer Science 2025-05-07 Hanyu Hu , Xiaoming Yuan

Large Language Models (LLMs) have achieved remarkable success in natural language processing tasks, but their massive size and computational demands hinder their deployment in resource-constrained environments. Existing model pruning…

Computation and Language · Computer Science 2025-08-14 Shangyu Wu , Hongchao Du , Ying Xiong , Shuai Chen , Tei-Wei Kuo , Nan Guan , Chun Jason Xue

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

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…

Computation and Language · Computer Science 2026-04-20 Jiaxi Bi , Tongxu Luo , Wenyu Du , Zhengyang Tang , Benyou Wang

Large language models (LLMs) can refine their responses based on feedback, enabling self-improvement through iterative training or test-time refinement. However, existing methods predominantly focus on refinement within the same reasoning…

Computation and Language · Computer Science 2024-12-24 Dian Yu , Yuheng Zhang , Jiahao Xu , Tian Liang , Linfeng Song , Zhaopeng Tu , Haitao Mi , Dong Yu

Long-context inference enhances the reasoning capability of Large Language Models (LLMs), but incurs significant computational overhead. Token-oriented methods, such as pruning and skipping, have shown great promise in reducing inference…

Computation and Language · Computer Science 2026-02-03 Zimeng Wu , Donghao Wang , Chaozhe Jin , Jiaxin Chen , Yunhong Wang

Deploying transformer models in practice is challenging due to their inference cost, which scales quadratically with input sequence length. To address this, we present a novel Learned Token Pruning (LTP) method which adaptively removes…

Computation and Language · Computer Science 2022-06-06 Sehoon Kim , Sheng Shen , David Thorsley , Amir Gholami , Woosuk Kwon , Joseph Hassoun , Kurt Keutzer

The recent advancements in large language models (LLMs) have significantly improved language understanding and generation capabilities. However, it is difficult to deploy LLMs on resource-constrained edge devices due to their high…

Computation and Language · Computer Science 2024-12-20 Haotian Zheng , Jinke Ren , Yushan Sun , Ruichen Zhang , Wenbo Zhang , Zhen Li , Dusit Niyato , Shuguang Cui , Yatong Han

Deep learning drives a new wave in computing systems and triggers the automation of increasingly complex problems. In particular, Large Language Models (LLMs) have significantly advanced cognitive tasks, often matching or even surpassing…

Making large language models (LLMs) more efficient in memory, latency, and serving cost is crucial for edge deployment, interactive applications, and sustainable inference at scale. Pruning is a promising technique, but existing pruning…

Computation and Language · Computer Science 2025-10-13 Eugene Kwek , Wenpeng Yin

Efficient inference in Large Vision-Language Models is constrained by the high cost of processing thousands of visual tokens, yet it remains unclear which tokens and computations can be safely removed. While attention scores are commonly…

Computer Vision and Pattern Recognition · Computer Science 2026-02-03 Samyak Jha , Junho Kim

Large language models (LLMs) achieve strong reasoning performance through chain-of-thought (CoT) reasoning, yet often generate unnecessarily long reasoning paths that incur high inference cost. Recent self-consistency-based approaches…

Computation and Language · Computer Science 2026-03-19 Juming Xiong , Kevin Guo , Congning Ni , Chao Yan , Katherine Brown , Avinash Baidya , Xiang Gao , Bradley Malin , Zhijun Yin

We introduce Probe Pruning (PP), a novel framework for online, dynamic, structured pruning of Large Language Models (LLMs) applied in a batch-wise manner. PP leverages the insight that not all samples and tokens contribute equally to the…

Computation and Language · Computer Science 2025-02-24 Qi Le , Enmao Diao , Ziyan Wang , Xinran Wang , Jie Ding , Li Yang , Ali Anwar
‹ Prev 1 2 3 10 Next ›