<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Prompt Optimization | Yiyang "Diana" Wang</title><link>https://hello-diana.github.io/tags/prompt-optimization/</link><atom:link href="https://hello-diana.github.io/tags/prompt-optimization/index.xml" rel="self" type="application/rss+xml"/><description>Prompt Optimization</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Wed, 20 May 2026 00:00:00 +0000</lastBuildDate><image><url>https://hello-diana.github.io/media/icon_hu_3520ea6f5cfedd63.png</url><title>Prompt Optimization</title><link>https://hello-diana.github.io/tags/prompt-optimization/</link></image><item><title>TextReg</title><link>https://hello-diana.github.io/project/textreg/</link><pubDate>Wed, 20 May 2026 00:00:00 +0000</pubDate><guid>https://hello-diana.github.io/project/textreg/</guid><description>&lt;p>Large language models are highly sensitive to their prompts, and iterative prompt-optimization methods that rewrite prompts from model feedback tend to overfit: prompts grow longer, accumulate narrow sample-specific rules, and generalize poorly beyond the training distribution. We frame this failure mode as &lt;strong>prompt distributional overfitting&lt;/strong> and measure it through &lt;em>representational inefficiency&lt;/em>, which decomposes prompt inefficiency into capacity cost and scope narrowness.&lt;/p>
&lt;p>&lt;strong>TextReg&lt;/strong> is a regularization framework that realizes a soft-penalty objective through regularized textual gradients, combining three stages: Dual-Evidence Gradient Purification, Semantic Edit Regularization, and Regularization-Guided Prompt Update.&lt;/p>
&lt;p>
&lt;figure >
&lt;div class="flex justify-center ">
&lt;div class="w-100" >&lt;img alt="The TextReg pipeline: Dual-Evidence Gradient Purification, Semantic Edit Regularization, and Regularization-Guided Prompt Update (adapted from the paper)." srcset="
/project/textreg/framework_hu_2dc2964a137b7d46.webp 400w,
/project/textreg/framework_hu_42bb8845c72621b5.webp 760w,
/project/textreg/framework_hu_de2a3ee30da79edc.webp 1200w"
src="https://hello-diana.github.io/project/textreg/framework_hu_2dc2964a137b7d46.webp"
width="760"
height="330"
loading="lazy" data-zoomable />&lt;/div>
&lt;/div>&lt;/figure>
&lt;/p>
&lt;p>&lt;strong>My role.&lt;/strong> I am a co-author on this collaboration. Across multiple reasoning benchmarks, TextReg substantially improves out-of-distribution generalization, with accuracy gains of up to +11.8% over TextGrad and +16.5% over REVOLVE.&lt;/p></description></item><item><title>TextReg: Mitigating Prompt Distributional Overfitting via Regularized Text-Space Optimization</title><link>https://hello-diana.github.io/publication/textreg/</link><pubDate>Wed, 20 May 2026 00:00:00 +0000</pubDate><guid>https://hello-diana.github.io/publication/textreg/</guid><description>&lt;h2 id="abstract">Abstract&lt;/h2>
&lt;p>LLMs are highly sensitive to their prompts, and iterative prompt-optimization methods often overfit: prompts grow longer, accumulate sample-specific rules, and generalize poorly. We study this as &lt;strong>prompt distributional overfitting&lt;/strong> and introduce &lt;strong>TextReg&lt;/strong>, a regularization framework that realizes a soft-penalty objective through regularized textual gradients — combining Dual-Evidence Gradient Purification, Semantic Edit Regularization, and Regularization-Guided Prompt Update. Across reasoning benchmarks, TextReg improves out-of-distribution generalization by up to +11.8% over TextGrad and +16.5% over REVOLVE.&lt;/p></description></item></channel></rss>