English
Related papers

Related papers: TEMPERA: Test-Time Prompting via Reinforcement Lea…

200 papers

Pre-trained models have been shown effective in many code intelligence tasks. These models are pre-trained on large-scale unlabeled corpus and then fine-tuned in downstream tasks. However, as the inputs to pre-training and downstream tasks…

Software Engineering · Computer Science 2022-07-26 Chaozheng Wang , Yuanhang Yang , Cuiyun Gao , Yun Peng , Hongyu Zhang , Michael R. Lyu

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

Question generation has numerous applications in the educational context. Question generation can prove helpful for students when reviewing content and testing themselves. Furthermore, a question generation model can aid teachers by…

Computation and Language · Computer Science 2023-10-31 Rubaba Amyeen

Vision-language models (VLMs), such as CLIP, have gained significant popularity as foundation models, with numerous fine-tuning methods developed to enhance performance on downstream tasks. However, due to their inherent vulnerability and…

Machine Learning · Computer Science 2025-08-28 Lijun Sheng , Jian Liang , Zilei Wang , Ran He

While the numerous parameters in Large Language Models (LLMs) contribute to their superior performance, this massive scale makes them inefficient and memory-hungry. Thus, they are hard to deploy on commodity hardware, such as one single…

Computation and Language · Computer Science 2023-10-11 Zhaozhuo Xu , Zirui Liu , Beidi Chen , Yuxin Tang , Jue Wang , Kaixiong Zhou , Xia Hu , Anshumali Shrivastava

Pretrained language models (PLMs) have shown remarkable few-shot learning capabilities when provided with properly formatted examples. However, selecting the "best" examples remains an open challenge. We propose a complexity-based prompt…

Computation and Language · Computer Science 2024-08-01 Rishabh Adiga , Lakshminarayanan Subramanian , Varun Chandrasekaran

Few-shot prompting and step-by-step reasoning have enhanced the capabilities of Large Language Models (LLMs) in tackling complex tasks including code generation. In this paper, we introduce a prompt selection and augmentation algorithm…

Robotics · Computer Science 2024-03-21 On Tai Wu , Frodo Kin Sun Chan , Zunhao Zhang , Yan Nei Law , Benny Drescher , Edmond Shiao Bun Lai

Continual Test-Time Adaptation (CTTA) aims to adapt the source model to continually changing unlabeled target domains without access to the source data. Existing methods mainly focus on model-based adaptation in a self-training manner, such…

Computer Vision and Pattern Recognition · Computer Science 2023-02-14 Yulu Gan , Yan Bai , Yihang Lou , Xianzheng Ma , Renrui Zhang , Nian Shi , Lin Luo

Large pre-trained vision-language models such as CLIP have demonstrated great potential in zero-shot transferability to downstream tasks. However, to attain optimal performance, the manual selection of prompts is necessary to improve…

Computer Vision and Pattern Recognition · Computer Science 2024-09-17 Thi Minh Anh Pham , An Duc Nguyen , Cephas Svosve , Vasileios Argyriou , Georgios Tzimiropoulos

Computer vision models suffer from a phenomenon known as catastrophic forgetting when learning novel concepts from continuously shifting training data. Typical solutions for this continual learning problem require extensive rehearsal of…

Computer Vision and Pattern Recognition · Computer Science 2023-03-31 James Seale Smith , Leonid Karlinsky , Vyshnavi Gutta , Paola Cascante-Bonilla , Donghyun Kim , Assaf Arbelle , Rameswar Panda , Rogerio Feris , Zsolt Kira

Over-prompting, a phenomenon where excessive examples in prompts lead to diminished performance in Large Language Models (LLMs), challenges the conventional wisdom about in-context few-shot learning. To investigate this few-shot dilemma, we…

Computation and Language · Computer Science 2025-09-17 Yongjian Tang , Doruk Tuncel , Christian Koerner , Thomas Runkler

As the pre-trained language models (PLMs) continue to grow, so do the hardware and data requirements for fine-tuning PLMs. Therefore, the researchers have come up with a lighter method called \textit{Prompt Learning}. However, during the…

Computation and Language · Computer Science 2022-09-07 Yundi Shi , Piji Li , Changchun Yin , Zhaoyang Han , Lu Zhou , Zhe Liu

We propose a method for arbitrary textual style transfer (TST)--the task of transforming a text into any given style--utilizing general-purpose pre-trained language models. Our method, Prompt-and-Rerank, is based on a mathematical…

Computation and Language · Computer Science 2022-05-24 Mirac Suzgun , Luke Melas-Kyriazi , Dan Jurafsky

Large language models have exhibited intriguing in-context learning capability, achieving promising zero- and few-shot performance without updating the parameters. However, conventional in-context learning is usually restricted by length…

Computation and Language · Computer Science 2022-12-14 Yaru Hao , Yutao Sun , Li Dong , Zhixiong Han , Yuxian Gu , Furu Wei

Large Language Models (LLMs) can perform various natural language processing tasks with suitable instruction prompts. However, designing effective prompts manually is challenging and time-consuming. Existing methods for automatic prompt…

Computation and Language · Computer Science 2024-04-04 Viet-Tung Do , Van-Khanh Hoang , Duy-Hung Nguyen , Shahab Sabahi , Jeff Yang , Hajime Hotta , Minh-Tien Nguyen , Hung Le

Prompt engineering is a new paradigm for enhancing the performance of trained neural network models. For optimizing text-style prompts, existing methods usually individually operate small portions of a text step by step, which either breaks…

Computation and Language · Computer Science 2023-10-03 Yujian Betterest Li , Kai Wu

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…

Computation and Language · Computer Science 2024-07-01 Shouchang Guo , Sonam Damani , Keng-hao Chang

Large language models (LLMs) have been proposed as scalable tools to address the gap between the importance of individualized written feedback and the practical challenges of providing it at scale. However, concerns persist regarding the…

Other Statistics · Statistics 2025-11-12 Niklas Ippisch , Markus Herklotz , Anna-Carolina Haensch , Carsten Schwemmer

Re-rankers, which order retrieved documents with respect to the relevance score on the given query, have gained attention for the information retrieval (IR) task. Rather than fine-tuning the pre-trained language model (PLM), the large-scale…

Information Retrieval · Computer Science 2023-05-24 Sukmin Cho , Soyeong Jeong , Jeongyeon Seo , Jong C. Park

Vision-Language Models (VLMs), such as CLIP, have achieved significant zero-shot performance on downstream tasks with various fine-tuning adaptation methods. However, recent studies have proven that adversarial attacks can significantly…

Computer Vision and Pattern Recognition · Computer Science 2026-05-20 Jia-Wei Hai , Yijun Wang , Xiu-Shen Wei
‹ Prev 1 8 9 10 Next ›