English
Related papers

Related papers: Cross-Family Speculative Prefill: Training-Free Lo…

200 papers

Despite notable advancements in prompting methods for Large Language Models (LLMs), such as Chain-of-Thought (CoT), existing strategies still suffer from excessive token usage and limited generalisability across diverse reasoning tasks. To…

Computation and Language · Computer Science 2026-01-14 Bowen Li , Ziqi Xu , Jing Ren , Renqiang Luo , Xikun Zhang , Xiuzhen Zhang , Yongli Ren , Feng Xia

The rise of Large Language Models (LLMs) has led to significant interest in prompt compression, a technique aimed at reducing the length of input prompts while preserving critical information. However, the prominent approaches in prompt…

Computation and Language · Computer Science 2025-02-20 Barys Liskavets , Shuvendu Roy , Maxim Ushakov , Mark Klibanov , Ali Etemad , Shane Luke

Large language models (LLMs) have demonstrated remarkable capabilities across various tasks. However, their widespread application is hindered by the resource-intensive decoding process. To address this challenge, current approaches have…

Computation and Language · Computer Science 2024-04-19 Ziqian Zeng , Jiahong Yu , Qianshi Pang , Zihao Wang , Huiping Zhuang , Hongen Shao , Xiaofeng Zou

Foundation models face growing compute and memory bottlenecks, hindering deployment on resource-limited platforms. While compression techniques such as pruning and quantization are widely used, most rely on uniform heuristics that ignore…

Machine Learning · Computer Science 2025-09-09 Sadegh Jafari , Aishwarya Sarkar , Mohiuddin Bilwal , Ali Jannesari

Performing inference on large volumes of samples with large language models (LLMs) can be computationally and financially costly in industry and real-world use. We propose batch prompting, a simple yet effective prompting approach that…

Computation and Language · Computer Science 2023-10-25 Zhoujun Cheng , Jungo Kasai , Tao Yu

Prompt engineering has emerged as an indispensable technique for extending the capabilities of large language models (LLMs) and vision-language models (VLMs). This approach leverages task-specific instructions, known as prompts, to enhance…

Artificial Intelligence · Computer Science 2025-03-18 Pranab Sahoo , Ayush Kumar Singh , Sriparna Saha , Vinija Jain , Samrat Mondal , Aman Chadha

Due to their architecture and vast pre-training data, large language models (LLMs) demonstrate strong text classification performance. However, LLM output - here, the category assigned to a text - depends heavily on the wording of the…

Computation and Language · Computer Science 2025-12-04 Kylie L. Anglin , Stephanie Milan , Brittney Hernandez , Claudia Ventura

Large language models (LLMs) exhibit remarkable reasoning capabilities across diverse downstream tasks. However, their autoregressive nature leads to substantial inference latency, posing challenges for real-time applications. Speculative…

Computation and Language · Computer Science 2025-06-18 Tao He , Guang Huang , Yu Yang , Tianshi Xu , Sicheng Zhao , Guiguang Ding , Pengyang Wang , Feng Tian

Prompt tuning is a parameter-efficient way to deploy large-scale pre-trained models to downstream tasks by adding task-specific tokens. In terms of vision-language pre-trained (VLP) models, prompt tuning often requires a large number of…

Computer Vision and Pattern Recognition · Computer Science 2023-08-22 Qiong Wu , Shubin Huang , Yiyi Zhou , Pingyang Dai , Annan Shu , Guannan Jiang , Rongrong Ji

Speculative decoding accelerates memory-bound LLM inference without quality degradation by using a fast drafter to propose multiple candidate tokens and the target model to verify them in parallel. However, conventional sequential…

Computation and Language · Computer Science 2026-05-20 Yaojie Zhang , Jianuo Huang , Junlong Ke , Yuhang Han , Yongji Long , Tianchen Zhao , Biqing Qi , Linfeng Zhang

Large Reasoning Models (LRMs) have shown promising accuracy improvements on complex problem-solving tasks. While these models have attained high accuracy by leveraging additional computation at test time, they need to generate long…

Computation and Language · Computer Science 2025-12-16 Coleman Hooper , Sebastian Zhao , Luca Manolache , Sehoon Kim , Michael W. Mahoney , Yakun Sophia Shao , Kurt Keutzer , Amir Gholami

Recent advances in fine-tuning large language models (LLMs) have greatly enhanced their usage in domain-specific tasks. Despite the success, fine-tuning continues to rely on repeated and lengthy prompts, which escalate computational…

Computation and Language · Computer Science 2024-10-17 Jiaru Zou , Mengyu Zhou , Tao Li , Shi Han , Dongmei Zhang

Large language models solve complex tasks by generating long reasoning chains, achieving higher accuracy at the cost of increased computational cost and reduced ability to isolate functionally relevant reasoning. Prior work on compact…

Computation and Language · Computer Science 2026-04-22 Janvijay Singh , Dilek Hakkani-Tür

Large language models (LLMs) can perform recommendation tasks by taking prompts written in natural language as input. Compared to traditional methods such as collaborative filtering, LLM-based recommendation offers advantages in handling…

Information Retrieval · Computer Science 2025-07-21 Genki Kusano , Kosuke Akimoto , Kunihiro Takeoka

The large language models have achieved superior performance on various natural language tasks. One major drawback of such approaches is they are resource-intensive in fine-tuning new datasets. Soft-prompt tuning presents a…

Computation and Language · Computer Science 2023-10-30 Guoxin Chen , Yiming Qian , Bowen Wang , Liangzhi Li

Long chain-of-thought~(CoT) has become a dominant paradigm for enhancing the reasoning capability of large reasoning models~(LRMs); however, the performance gains often come with a substantial increase in reasoning budget. Recent studies…

Artificial Intelligence · Computer Science 2026-03-03 Jie Cao , Tianwei Lin , Zhenxuan Fan , Bo Yuan , Ziyuan Zhao , Rolan Yan , Wenqiao Zhang , Siliang Tang

Large Vision-Language Models (LVLMs) excel in visual understanding and reasoning, but the excessive visual tokens lead to high inference costs. Although recent token reduction methods mitigate this issue, they mainly target single-turn…

Computer Vision and Pattern Recognition · Computer Science 2026-03-24 Yi Wang , Haofei Zhang , Qihan Huang , Anda Cao , Gongfan Fang , Wei Wang , Xuan Jin , Jie Song , Mingli Song , Xinchao Wang

Large Language Models (LLMs) face significant computational challenges when processing long contexts due to the quadratic complexity of self-attention. While soft context compression methods, which map input text to smaller latent…

Computation and Language · Computer Science 2025-09-24 Gabriele Berton , Jayakrishnan Unnikrishnan , Son Tran , Mubarak Shah

Providing extensive context via prompting is vital for leveraging the capabilities of Large Language Models (LLMs). However, lengthy contexts significantly increase inference latency, as the computational cost of self-attention grows…

Artificial Intelligence · Computer Science 2026-02-17 Guojie Liu , Yiqi Wang , Yanfeng Yang , Wenqi Fan , Songlei Jian , Jianfeng Zhang , Jie Yu

The quadratic complexity of self-attention in Transformer models remains a significant bottleneck for processing long sequences and deploying large language models efficiently. For this approach, there has been significant research into…

Computation and Language · Computer Science 2026-05-26 Spandan Pratyush
‹ Prev 1 4 5 6 7 8 10 Next ›