English
Related papers

Related papers: Dynamic Compressing Prompts for Efficient Inferenc…

200 papers

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

Prompting has shown impressive success in enabling large pretrained language models (LMs) to perform diverse NLP tasks, especially when only few downstream data are available. Automatically finding the optimal prompt for each task, however,…

Computation and Language · Computer Science 2022-10-25 Mingkai Deng , Jianyu Wang , Cheng-Ping Hsieh , Yihan Wang , Han Guo , Tianmin Shu , Meng Song , Eric P. Xing , Zhiting Hu

Large Language Models (LLMs) have changed the way natural language processing works, but it is still hard to store and manage prompts efficiently in production environments. This paper presents LoPace (Lossless Optimized Prompt Accurate…

Databases · Computer Science 2026-02-17 Aman Ulla

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

Offering rich contexts to Large Language Models (LLMs) has shown to boost the performance in various tasks, but the resulting longer prompt would increase the computational cost and might exceed the input limit of LLMs. Recently, some…

Computation and Language · Computer Science 2025-09-30 Wenhao Mao , Chengbin Hou , Tianyu Zhang , Xinyu Lin , Ke Tang , Hairong Lv

Decoding from large language models (LLMs) typically relies on fixed sampling hyperparameters (e.g., temperature, top-p), despite substantial variation in task difficulty and uncertainty across prompts and individual decoding steps. We…

Machine Learning · Computer Science 2026-03-17 Chloe H. Su , Zhe Ye , Samuel Tenka , Aidan Yang , Soonho Kong , Udaya Ghai

Large Reasoning Models (LRMs) have demonstrated impressive capabilities but suffer from cognitive inefficiencies like "overthinking" simple problems and "underthinking" complex ones. While existing methods that use supervised fine-tuning…

Artificial Intelligence · Computer Science 2026-03-24 Tian Liang , Wenxiang Jiao , Zhiwei He , Jiahao Xu , Haitao Mi , Dong Yu

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

Large language models have demonstrated outstanding performance on a wide range of tasks such as question answering and code generation. On a high level, given an input, a language model can be used to automatically complete the sequence in…

Computation and Language · Computer Science 2023-05-31 Luca Beurer-Kellner , Marc Fischer , Martin Vechev

Large language models (LLMs) offer substantial promise for text classification in political science, yet their effectiveness often depends on high-quality prompts and exemplars. To address this, we introduce a three-stage framework that…

Computation and Language · Computer Science 2025-04-08 Menglin Liu , Ge Shi

Large Language Models (LLMs) have achieved remarkable success across diverse tasks, largely driven by well-designed prompts. However, crafting and selecting such prompts often requires considerable human effort, significantly limiting its…

Computation and Language · Computer Science 2025-03-20 Dengyun Peng , Yuhang Zhou , Qiguang Chen , Jinhao Liu , Jingjing Chen , Libo Qin

Large language models (LLMs) process entire input contexts indiscriminately, which is inefficient when the information required to answer a query is localized within the context. We present dynamic context cutoff, a novel method enabling…

Computation and Language · Computer Science 2026-02-10 Roy Xie , Junlin Wang , Paul Rosu , Chunyuan Deng , Bolun Sun , Zihao Lin , Bhuwan Dhingra

As large language models (LLMs) improve their capabilities in handling complex tasks, the issues of computational cost and efficiency due to long prompts are becoming increasingly prominent. To accelerate model inference and reduce costs,…

Computation and Language · Computer Science 2024-09-04 Xuechen Liang , Meiling Tao , Yinghui Xia , Tianyu Shi , Jun Wang , JingSong Yang

The performance of Large Language Models (LLMs) depends heavily on the chosen prompting strategy, yet static approaches such as Zero-Shot, Few-Shot, or Chain-of-Thought (CoT) impose a rigid efficiency-accuracy trade-off. Highly accurate…

Machine Learning · Computer Science 2025-10-01 Jiexi Xu

Large Language Models (LLMs) exhibit remarkable proficiency in addressing a diverse array of tasks within the Natural Language Processing (NLP) domain, with various prompt design strategies significantly augmenting their capabilities.…

Computation and Language · Computer Science 2024-08-05 Xiangyu Zhao , Chengqian Ma

Transformers have emerged as the backbone of large language models (LLMs). However, generation remains inefficient due to the need to store in memory a cache of key-value representations for past tokens, whose size scales linearly with the…

Computation and Language · Computer Science 2024-07-24 Piotr Nawrot , Adrian Łańcucki , Marcin Chochowski , David Tarjan , Edoardo M. Ponti

Large language models (LLMs) are great at processing multiple natural language processing tasks, but their abilities are constrained by inferior performance with long context, slow inference speed, and the high cost of computing the…

Computation and Language · Computer Science 2024-04-03 Yu-Neng Chuang , Tianwei Xing , Chia-Yuan Chang , Zirui Liu , Xun Chen , Xia Hu

Human communication heavily relies on laconism and inferential pragmatics, allowing listeners to successfully reconstruct rich meaning from sparse, telegraphic speech. In contrast, large language models (LLMs) owe much of their stellar…

Computation and Language · Computer Science 2026-03-13 Syed Rifat Raiyan , Md Farhan Ishmam , Abdullah Al Imran , Mohammad Ali Moni

Recently, prompt tuning \cite{lester2021power} has gradually become a new paradigm for NLP, which only depends on the representation of the words by freezing the parameters of pre-trained language models (PLMs) to obtain remarkable…

Computation and Language · Computer Science 2022-01-31 Pan He , Yuxi Chen , Yan Wang , Yanru Zhang

As large language models (LLMs) tackle increasingly complex tasks and longer documents, their computational and memory costs during inference become a major bottleneck. To address this, we propose PromptDistill, a novel, training-free…

Computation and Language · Computer Science 2025-04-01 Weisheng Jin , Maojia Song , Tej Deep Pala , Yew Ken Chia , Amir Zadeh , Chuan Li , Soujanya Poria