中文
相关论文

相关论文: Efficient Multi-objective Prompt Optimization via …

200 篇论文

Contextual multi-armed bandit problems arise frequently in important industrial applications. Existing solutions model the context either linearly, which enables uncertainty driven (principled) exploration, or non-linearly, by using…

机器学习 · 计算机科学 2018-07-27 Mark Collier , Hector Urdiales Llorens

Prompt engineering has demonstrated remarkable success in enhancing the performance of large language models (LLMs) across diverse tasks. However, most existing prompt optimization methods only focus on the task-level performance,…

人工智能 · 计算机科学 2025-06-02 Yilun Kong , Hangyu Mao , Qi Zhao , Bin Zhang , Jingqing Ruan , Li Shen , Yongzhe Chang , Xueqian Wang , Rui Zhao , Dacheng Tao

Large Language Models (LLMs) have shown impressive abilities in many applications. When a concrete and precise answer is desired, it is important to have a quantitative estimation of the potential error rate. However, this can be…

计算与语言 · 计算机科学 2024-12-20 Theodore Zhao , Mu Wei , J. Samuel Preston , Hoifung Poon

Automatic prompt optimization frameworks are developed to obtain suitable prompts for large language models (LLMs) with respect to desired output quality metrics. Although existing approaches can handle conventional tasks such as…

计算与语言 · 计算机科学 2025-05-14 Chun-Pai Yang , Kan Zheng , Shou-De Lin

Motivated by the importance of explainability in modern machine learning, we design bandit algorithms that are efficient and interpretable. A bandit algorithm is interpretable if it explores with the objective of reducing uncertainty in the…

机器学习 · 计算机科学 2024-02-12 Subhojyoti Mukherjee , Ruihao Zhu , Branislav Kveton

A large number of heuristics have been proposed to optimize the reinforcement fine-tuning of LLMs. However, inconsistent claims are made from time to time, making this area elusive. Reflecting on this situation, two fundamental questions…

机器学习 · 计算机科学 2026-01-22 Xiao Hu , Hong Xie , Tao Tan , Defu Lian , Jianyu Han

We consider a sequential assortment selection problem where the user choice is given by a multinomial logit (MNL) choice model whose parameters are unknown. In each period, the learning agent observes a $d$-dimensional contextual…

机器学习 · 统计学 2021-03-26 Min-hwan Oh , Garud Iyengar

We consider the problem of near-optimal arm identification in the fixed confidence setting of the infinitely armed bandit problem when nothing is known about the arm reservoir distribution. We (1) introduce a PAC-like framework within which…

机器学习 · 统计学 2018-05-22 Maryam Aziz , Jesse Anderton , Emilie Kaufmann , Javed Aslam

We analytically derive a class of optimal solutions to a linear program (LP) for automated mechanism design that satisfies efficiency, incentive compatibility, strong budget balance (SBB), and individual rationality (IR), where SBB and IR…

计算机科学与博弈论 · 计算机科学 2025-05-20 Takayuki Osogami , Hirota Kinoshita , Segev Wasserkrug

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…

计算与语言 · 计算机科学 2022-09-07 Yundi Shi , Piji Li , Changchun Yin , Zhaoyang Han , Lu Zhou , Zhe Liu

Recent advances have witnessed the effectiveness of reinforcement learning (RL) finetuning in enhancing the reasoning capabilities of large language models (LLMs). The optimization process often requires numerous iterations to achieve…

人工智能 · 计算机科学 2026-01-13 Yun Qu , Qi Wang , Yixiu Mao , Vincent Tao Hu , Björn Ommer , Xiangyang Ji

Contextual Bandits is one of the widely popular techniques used in applications such as personalization, recommendation systems, mobile health, causal marketing etc . As a dynamic approach, it can be more efficient than standard A/B testing…

机器学习 · 计算机科学 2022-02-03 Praneet Dutta , Joe Cheuk , Jonathan S Kim , Massimo Mascaro

Large Language Model (LLM) has demonstrated significant ability in various Natural Language Processing tasks. However, their effectiveness is highly dependent on the phrasing of the task prompt, leading to research on automatic prompt…

计算与语言 · 计算机科学 2024-02-06 Moxin Li , Wenjie Wang , Fuli Feng , Yixin Cao , Jizhi Zhang , Tat-Seng Chua

Large language models (LLMs) have shown impressive capabilities in real-world applications. The capability of in-context learning (ICL) allows us to adapt an LLM to downstream tasks by including input-label exemplars in the prompt without…

Requirements classification assigns natural language requirements to predefined classes, such as functional and non functional. Accurate classification reduces risk and improves software quality. Most existing models rely on supervised…

软件工程 · 计算机科学 2025-09-18 Manal Binkhonain , Reem Alfayaz

We study the preference-based pure exploration problem for bandits with vector-valued rewards. The rewards are ordered using a (given) preference cone $\mathcal{C}$ and our goal is to identify the set of Pareto optimal arms. First, to…

机器学习 · 统计学 2025-01-20 Apurv Shukla , Debabrota Basu

Given a task in the form of a basic description and its training examples, prompt optimization is the problem of synthesizing the given information into a text prompt for a large language model. Humans solve this problem by also considering…

人工智能 · 计算机科学 2025-05-20 Gurusha Juneja , Gautam Jajoo , Nagarajan Natarajan , Hua Li , Jian Jiao , Amit Sharma

In recent years, the growing interest in Large Language Models (LLMs) has significantly advanced prompt engineering, transitioning from manual design to model-based optimization. Prompts for LLMs generally comprise two components: the…

计算与语言 · 计算机科学 2025-10-09 Qinhao Zhou , Xiang Xiang , Kun He , John E. Hopcroft

Multi-Armed Bandit (MAB) algorithms are widely used in recommender systems that require continuous, incremental learning. A core aspect of MABs is the exploration-exploitation trade-off: choosing between exploiting items likely to be…

机器学习 · 计算机科学 2026-04-20 Pedro R. Pires , Gregorio F. Azevedo , Pietro L. Campos , Rafael T. Sereicikas , Tiago A. Almeida

We study multi-task representation learning for the problem of pure exploration in bilinear bandits. In bilinear bandits, an action takes the form of a pair of arms from two different entity types and the reward is a bilinear function of…

机器学习 · 计算机科学 2023-11-02 Subhojyoti Mukherjee , Qiaomin Xie , Josiah P. Hanna , Robert Nowak