GRAD-SUM: Leveraging Gradient Summarization for Optimal Prompt Engineering

Derek Austin, Elliott Chartock
7/12/2024
cs.CLcs.AI

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Prompt engineering for large language models (LLMs) is often a manual time-intensive process that involves generating, evaluating, and refining prompts iteratively to ensure high-quality outputs. While there has been work on automating prompt engineering, the solutions generally are either tuned to specific tasks with given answers or are quite costly. We introduce GRAD-SUM, a scalable and flexible method for automatic prompt engineering that builds on gradient-based optimization techniques. Our approach incorporates user-defined task descriptions and evaluation criteria, and features a novel gradient summarization module to generalize feedback effectively. Our results demonstrate that GRAD-SUM consistently outperforms existing methods across various benchmarks, highlighting its versatility and effectiveness in automatic prompt optimization.

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. 1 weaker match is 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{austin2024gradsum,
  title  = {GRAD-SUM: Leveraging Gradient Summarization for Optimal Prompt Engineering},
  author = {Derek Austin and Elliott Chartock},
  year   = {2024},
  eprint = {2407.12865},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2407.12865v1}
}

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/2407.12865.svg)](https://codeofpaper.com/paper/2407.12865)

Discussion