Prompt Optimization with Logged Bandit Data

Haruka Kiyohara, Daniel Yiming Cao, Yuta Saito, Thorsten Joachims
4/3/2025
cs.LGcs.AIcs.IR

No confident code implementation found for this paper. 3 possible matches can be shown below.

Abstract

We study how to use naturally available user feedback, such as clicks, to optimize large language model (LLM) pipelines for generating personalized sentences using prompts. Naive approaches, which estimate the policy gradient in the prompt space, suffer either from variance caused by the large action space of prompts or bias caused by inaccurate reward predictions. To circumvent these challenges, we propose a novel kernel-based off-policy gradient method, which estimates the policy gradient by leveraging similarity among generated sentences, substantially reducing variance while suppressing the bias. Empirical results on our newly established suite of benchmarks demonstrate the effectiveness of the proposed approach in generating personalized descriptions for movie recommendations, particularly when the number of candidate prompts is large.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 3 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{kiyohara2025prompt,
  title  = {Prompt Optimization with Logged Bandit Data},
  author = {Haruka Kiyohara and Daniel Yiming Cao and Yuta Saito and Thorsten Joachims},
  year   = {2025},
  eprint = {2504.02646},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2504.02646v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2504.02646.svg)](https://codeofpaper.com/paper/2504.02646)

Discussion