arXiv AI

A Unified Evaluation-Instructed Framework for Query-Dependent Prompt Optimization

arXiv:2511. 19829v2 Announce Type: replace Abstract: Most prompt-optimization methods refine a single static template, making them ineffective in complex and dynamic user scenarios.

arXiv AI
Jun 26

Ask, Don't Judge: Binary Questions for Interpretable LLM Evaluation and Self-Improvement

arXiv:2606. 27226v1 Announce Type: new Abstract: Evaluating LLM outputs remains a major bottleneck in NLP: human evaluation is expensive and slow, lexical metrics correlate poorly with human judgments on open-ended generation, and holistic LLM judges often produce opaque scores that are hard to debug.

By Sangwoo Cho, Kushal Chawla, Pengshan Cai, Zefang Liu, Chenyang Zhu, Shi-Xiong Zhang, Sambit Sahu
arXiv AI
Aug 24

Beyond Prompt Engineering: A Systematic Analysis of Prompt Lexical Sensitivity and Its Impacts on Quality

The paper investigates how small lexical changes in prompts can cause large performance swings in large language models. Using a dataset of 132,000 prompt variants, the authors uncover a scaling law linking higher average task performance to lower variance and greater robustness. They identify domain-specific terminology and explicit action directives as key linguistic factors that stabilize prompts, and propose an automated Prompt-Refining Agent that reduces performance variance by 40.7% in code generation while maintaining or improving mean performance.

By Qipeng Xie, Zi Liang, Jiafei Wu, Yufei Chen, Weizheng Wang, Wenao Ma, Zhong Ming, Haiqin Yang, Kaishun Wu
Hugging Face Trending Papers
Jun 25

Ask, Don't Judge: Binary Questions for Interpretable LLM Evaluation and Self-Improvement

Evaluating LLM outputs remains a major bottleneck in NLP: human evaluation is expensive and slow, lexical metrics correlate poorly with human judgments on open-ended generation, and holistic LLM judges often produce opaque scores that are hard to debug. We propose BINEVAL, a framework that decomposes evaluation criteria into atomic binary questions and aggregates the resulting verdicts into interpretable, multi-dimensional scores.

arXiv Machine Learning
Aug 28

$p1$: Better Prompt Optimization with Fewer Prompts

The paper investigates why prompt optimization works better for some tasks than others by decomposing reward variance into response variance and system‑prompt variance. It finds that optimization succeeds when system‑prompt variance dominates, and that adding more user prompts can actually reduce this variance, especially on heterogeneous datasets. To address this, the authors propose $p1$, a filtering method that selects a small set of high‑variance user prompts, which improves optimization on reasoning benchmarks and even allows a system prompt trained on just two AIME 24 prompts to generalize well.

By Zhaolin Gao (Sid), Yu (Sid), Wang, Bo Liu, Thorsten Joachims, Kiant\'e Brantley, Wen Sun
arXiv AI
Sep 10

CriticGen: Generation-Aware Evaluation as Actionable Feedback

CriticGen introduces a generation‑aware evaluation framework that generates sample‑specific evaluation dimensions and scoring criteria across categories such as subjective, objective, and self‑derived constraints. These dynamic rubrics produce a score, reason, executable refinement suggestion, and a refined answer, enabling models to diagnose and target flaws in their responses. Experiments show significant gains in rubric quality, score correlation, and actionable feedback, with 73.17% of answers improved and a 93.28% non‑degradation rate.

By Huifang Du, Zecheng Zuo, Sen Wang, Chenghao Fan, Haofen Wang, Yehui Yang
arXiv Computation and Language
Sep 18

F$^{2}$DR: A Fine-Grained Full-Pipeline Reward Framework for DeepSearch Workflows

The paper introduces F$^{2}$DR, a fine‑grained reward framework designed to evaluate end‑to‑end DeepSearch workflows, which involve planning, reflection, retrieval, and answer generation. F$^{2}$DR assesses workflows along three dimensions—Content, Trajectory, and Answer—to provide a comprehensive process‑level evaluation. The authors also present DeepSearch RM‑Bench, a benchmark that tests reward models in DeepSearch scenarios and shows strong discriminative power over existing open‑source models.

By Bojian Xiong (Tianjin University), Wentao Ding (Baidu Inc.), Yujing Lu (Baidu Inc.), Shaowei Zhang (Tianjin University), Ling Shi (Tianjin University), Jing Liao (Baidu Inc.), Yan Wang (Baidu Inc.), Yueyang Zhang (Baidu Inc.), Long Xia (Baidu Inc.), Zhiyuan Sun (Baidu Inc.), Daiting Shi (Baidu Inc.), Jingzhou He (Baidu Inc.), Yuqi Ren (Tianjin University), Deyi Xiong (Tianjin University)