paper-with-me

Papers

PrefPO: Pairwise Preference Prompt Optimization

2026-03-13 · Rahul Singhal, Pradyumna Tambwekar, Karime Maamari arxiv

Prompt engineering is effective but labor-intensive, motivating automated optimization methods. Existing methods typically require labeled datasets, which are often unavailable, and produce verbose, repetitive prompts. We introduce PrefPO, a minimal prompt optimization approach inspired by reinforcement learning from human feedback (RLHF). Its preference-based approach reduces the need for labeled data and hyperparameter tuning-only a starting prompt and natural language criteria are needed. PrefPO uses an LLM discriminator to express pairwise preferences over model outputs and provide feedback to an LLM optimizer, iteratively improving performance. We evaluate PrefPO on 9 BIG-Bench Hard (BBH) tasks and IFEval-Hard, a newly-curated, challenging subset of IFEval. PrefPO matches or exceeds SOTA methods, including GEPA, MIPRO, and TextGrad, on 6/9 tasks and performs comparably to TextGrad on IFEval-Hard (82.4% vs 84.5%). Unlike other methods, PrefPO can optimize in both labeled and unlabeled settings. Without labels, PrefPO closely matches its labeled performance on 6/9 tasks, proving effective without ground truth. PrefPO also improves prompt hygiene: we find existing methods produce prompts 14.7x their original length or with 34% repetitive content; PrefPO reduces these issues by 3-5x. Furthermore, both LLM and human judges rate PrefPO's prompts higher than TextGrad's. Finally, we identify prompt hacking in prompt optimizers, where methods game evaluation criteria, and find PrefPO is susceptible at half the rate of TextGrad (37% vs 86%), generating fewer brittle, misaligned prompts.

📄 PDF Abstract BibTeX arXiv:2603.19311

Code (0)

등록된 구현이 없습니다.

Tasks

Reinforcement LearningPrompt Engineering

Similar Papers 제목 키워드 기반

PrefPoE: Advantage-Guided Preference Fusion for Learning Where to Explore

2025-11-11 · Zhihao Lin, Lin Wu, Zhen Tian, Jianglin Lan arxiv

Exploration in reinforcement learning remains a critical challenge, as naive entropy maximization often results in high variance and inefficient policy updates. We introduce \textbf{PrefPoE}, a novel \textit{Preference-P…

Reinforcement Learning

2D-Curri-DPO: Two-Dimensional Curriculum Learning for Direct Preference Optimization

2025-04-10 · Mengyang Li, Zhong Zhang

Aligning large language models with human preferences is crucial for their safe deployment. While Direct Preference Optimization (DPO) offers an efficient alternative to reinforcement learning from human feedback, tradit…

Model Optimization

Beyond Pairs: Your Language Model is Secretly Optimizing a Preference Graph

2026-05-08 · Ning Liu, Chuanneng Sun, Kristina Klinkner, Shervin Malmasi arxiv

Direct Preference Optimization (DPO) aligns language models using pairwise preference comparisons, offering a simple and effective alternative to Reinforcement Learning (RL) from human feedback. However, in many practica…

Reinforcement LearningProgram Synthesis

Beyond Pairwise Preferences: Listwise Reward-Aware Alignment for Diffusion Models

2026-05-26 · Austin Wang, Jiaqi Han, Stefano Ermon, Yisong Yue arxiv

Preference optimization has emerged as an efficient alternative to online reinforcement learning from human feedback (RLHF) for aligning text-to-image diffusion models. However, existing methods largely reduce supervisio…

Text-to-Image GenerationReinforcement LearningImage Editing

Beyond Pairwise: Empowering LLM Alignment With Ranked Choice Modeling

2025-10-24 · Yuxuan Tang, Yifan Feng arxiv

Alignment of large language models (LLMs) has predominantly relied on pairwise preference optimization, where annotators select the better of two responses to a prompt. While simple, this approach overlooks the opportuni…