中文
相关论文

相关论文: PromptIntern: Saving Inference Costs by Internaliz…

200 篇论文

Sequential recommender systems have achieved significant success in modeling temporal user behavior but remain limited in capturing rich user semantics beyond interaction patterns. Large Language Models (LLMs) present opportunities to…

Prompts used in recent large language model based applications are often fixed and lengthy, leading to significant computational overhead. To address this challenge, we propose Generative Prompt Internalization (GenPI), a lightweight method…

计算与语言 · 计算机科学 2026-02-12 Haebin Shin , Lei Ji , Yeyun Gong , Sungdong Kim , Eunbi Choi , Minjoon Seo

Enabling LLMs to improve their outputs by using more test-time computation is a critical step towards building generally self-improving agents that can operate on open-ended natural language. In this paper, we study the scaling of…

机器学习 · 计算机科学 2024-08-07 Charlie Snell , Jaehoon Lee , Kelvin Xu , Aviral Kumar

We study the problem of optimizing Large Language Model (LLM) inference scheduling to minimize total latency. LLM inference is an online and multi-task service process and also heavily energy consuming by which a pre-trained LLM processes…

机器学习 · 计算机科学 2025-09-03 Zixi Chen , Yinyu Ye , Zijie Zhou

Large language models (LLMs) have revolutionized zero-shot task performance, mitigating the need for task-specific annotations while enhancing task generalizability. Despite its advancements, current methods using trigger phrases such as…

计算与语言 · 计算机科学 2024-06-13 Saurabh Srivastava , Chengyue Huang , Weiguo Fan , Ziyu Yao

In prompt tuning, a prefix or suffix text is added to the prompt, and the embeddings (soft prompts) or token indices (hard prompts) of the prefix/suffix are optimized to gain more control over language models for specific tasks. This…

计算与语言 · 计算机科学 2024-07-01 Shouchang Guo , Sonam Damani , Keng-hao Chang

As the capabilities of pre-trained large language models (LLMs) continue to advance, the "pre-train and fine-tune" paradigm has become increasingly mainstream, leading to the development of various fine-tuning methods. However, the privacy…

计算与语言 · 计算机科学 2025-07-02 Jie Hou , Chuxiong Wu , Lannan Luo , Qiang Zeng

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

计算与语言 · 计算机科学 2022-10-25 Mingkai Deng , Jianyu Wang , Cheng-Ping Hsieh , Yihan Wang , Han Guo , Tianmin Shu , Meng Song , Eric P. Xing , Zhiting Hu

The performance of large language models in domain-specific tasks necessitates fine-tuning, which is computationally expensive and technically challenging. This paper focuses on parameter-efficient fine-tuning using soft prompting, a…

计算与语言 · 计算机科学 2025-06-09 Ananth Muppidi , Abhilash Nandy , Sambaran Bandyopadhyay

Pre-trained language models (PLMs) have attracted enormous attention over the past few years with their unparalleled performances. Meanwhile, the soaring cost to train PLMs as well as their amazing generalizability have jointly contributed…

计算与语言 · 计算机科学 2024-06-10 Tianrong Zhang , Zhaohan Xi , Ting Wang , Prasenjit Mitra , Jinghui Chen

There are two primary ways of incorporating new information into a language model (LM): changing its prompt or changing its parameters, e.g. via fine-tuning. Parameter updates incur no long-term storage cost for model changes. However, for…

计算与语言 · 计算机科学 2025-06-27 Eric Zhang , Leshem Choshen , Jacob Andreas

Large Language Models (LLMs) deliver powerful reasoning and generation capabilities but incur substantial run-time costs when operating in agentic workflows that chain together lengthy prompts and process rich data streams. We introduce…

Prompt injection attacks pose a pervasive threat to the security of Large Language Models (LLMs). State-of-the-art prevention-based defenses typically rely on fine-tuning an LLM to enhance its security, but they achieve limited…

密码学与安全 · 计算机科学 2025-11-17 Yupei Liu , Yanting Wang , Yuqi Jia , Jinyuan Jia , Neil Zhenqiang Gong

Leveraging inference-time search in large language models has proven effective in further enhancing a trained model's capability to solve complex mathematical and reasoning problems. However, this approach significantly increases…

机器学习 · 计算机科学 2025-10-29 Tianwei Ni , Allen Nie , Sapana Chaudhary , Yao Liu , Huzefa Rangwala , Rasool Fakoor

Recent advancements in large language models (LLMs) have raised concerns about inference costs, increasing the need for research into model compression. While knowledge distillation (KD) is a prominent method for this, research on KD for…

计算与语言 · 计算机科学 2024-09-30 Gyeongman Kim , Doohyuk Jang , Eunho Yang

The breakthrough performance of large language models (LLMs) comes with major computational footprints and high deployment costs. In this paper, we progress towards resolving this problem by proposing a novel structured compression approach…

机器学习 · 计算机科学 2023-10-27 Eldar Kurtic , Elias Frantar , Dan Alistarh

The inference process of modern large language models (LLMs) demands prohibitive computational resources, rendering them infeasible for deployment on consumer-grade devices. To address this limitation, recent studies propose distributed LLM…

密码学与安全 · 计算机科学 2025-05-26 Xinjian Luo , Ting Yu , Xiaokui Xiao

Pre-trained Language Models (PLMs) have achieved remarkable performance for various language understanding tasks in IR systems, which require the fine-tuning process based on labeled training data. For low-resource scenarios, prompt-based…

计算与语言 · 计算机科学 2022-04-04 Ziyun Xu , Chengyu Wang , Minghui Qiu , Fuli Luo , Runxin Xu , Songfang Huang , Jun Huang

Interaction with Large Language Models (LLMs) is primarily carried out via prompting. A prompt is a natural language instruction designed to elicit certain behaviour or output from a model. In theory, natural language prompts enable…

人机交互 · 计算机科学 2024-03-15 Michael Desmond , Michelle Brachman

Utilizing large language models (LLMs) for zero-shot document ranking is done in one of two ways: (1) prompt-based re-ranking methods, which require no further training but are only feasible for re-ranking a handful of candidate documents…

信息检索 · 计算机科学 2024-10-22 Shengyao Zhuang , Xueguang Ma , Bevan Koopman , Jimmy Lin , Guido Zuccon