Model Performance-Guided Evaluation Data Selection for Effective Prompt Optimization
Not on the map. Why?
Abstract (arXiv)
Optimizing Large Language Model (LLM) performance requires well-crafted prompts, but manual prompt engineering is labor-intensive and often ineffective. Automated prompt optimization techniques address this challenge but the majority of them rely on randomly selected evaluation subsets, which fail to represent the full dataset, leading to unreliable evaluations and suboptimal prompts. Existing coreset selection methods, designed for LLM benchmarking, are unsuitable for prompt optimization due to challenges in clustering similar samples, high data collection costs, and the unavailability of performance data for new or private datasets. To overcome these issues, we propose IPOMP, an Iterative evaluation data selection for effective Prompt Optimization using real-time Model Performance. IPOMP is a two-stage approach that selects representative and diverse samples using semantic clustering and boundary analysis, followed by iterative refinement with real-time model performance data to replace redundant samples. Evaluations on the BIG-bench dataset show that IPOMP improves effectiveness by 1.6% to 5.3% and stability by at least 57% compared with SOTA baselines, with minimal computational overhead below 1%. Furthermore, the results demonstrate that our real-time performance-guided refinement approach can be universally applied to enhance existing coreset selection methods.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 27 of its 41 references that are in the map. First posted on arXiv 15 May 2025.
Builds on
27 of 41 references.
References · 27
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
- 2022Large Language Models are Zero-Shot Reasonerscited by 4,374
- 2022Large Language Models Are Human-Level Prompt Engineerscited by 1,045
- 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 861
- 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 678
- 2023Automatic Prompt Optimization with "Gradient Descent" and Beam Searchcited by 653
- 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 533
- 2021Just Train Twice: Improving Group Robustness without Training Group Informationcited by 523
- 2022RLPrompt: Optimizing Discrete Text Prompts with Reinforcement Learningcited by 366
- 2017"Liar, Liar Pants on Fire": A New Benchmark Dataset for Fake News Detectioncited by 363
- 2019Selection via Proxy: Efficient Data Selection for Deep Learningcited by 339
- 2024tinyBenchmarks: evaluating LLMs with fewer examplescited by 310
15 more
- 2024A Survey on Data Selection for Language Modelscited by 236
- 2018Adversarial Active Learning for Deep Networks: a Margin Based Approachcited by 158
- 2021Active Learning by Acquiring Contrastive Examplescited by 156
- 2020Contextual Diversity for Active Learningcited by 139
- 2023Retroformer: Retrospective Large Language Agents with Policy Gradient Optimizationcited by 112
- 2023Anchor Points: Benchmarking Models with Much Fewer Examplescited by 86
- 2019Small-GAN: Speeding Up GAN Training Using Core-setscited by 41
- 2024100 instances is all you need: predicting the success of a new LLM on unseen data by testing on a few instancescited by 24
- 2023Auto-Instruct: Automatic Instruction Generation and Ranking for Black-Box Language Modelscited by 21
- 2024Task Facet Learning: A Structured Approach to Prompt Optimizationcited by 19
- 2024Efficient Universal Goal Hijacking with Semantics-guided Prompt Organizationcited by 16
- 2024One Prompt is not Enough: Automated Construction of a Mixture-of-Expert Promptscited by 16
- 2020Confident Coreset for Active Learning in Medical Image Analysiscited by 5
- 2022The Impact of Using Regression Models to Build Defect Classifierscited by 5
- 2023Optimal Sample Selection Through Uncertainty Estimation and Its Application in Deep Learningcited by 4
Built on by
Citing papers per year: 2026: 5.
5 papers.
- 2026Submodular Evaluation Subset Selection in Automatic Prompt Optimizationcited by 1
- 2026Select Smarter, Not More: Prompt-Aware Evaluation Scheduling with Submodular Guaranteescited by 1
- 2026AI Agent Systems for Supply Chains: Structured Decision Prompts and Memory Retrievalcited by 0
- 2026APEX: Automated Prompt Engineering eXpert with Dynamic Data Selectioncited by 0
- 2026AdaGEPA: Adaptive Feedback Allocation for Reflective Prompt Optimizationcited by 0
- 2026AdaGEPA: Adaptive Feedback Allocation for Reflective Prompt Optimization30 Sep 2026
- 2026APEX: Automated Prompt Engineering eXpert with Dynamic Data Selection9 Jun 2026
- 2026Select Smarter, Not More: Prompt-Aware Evaluation Scheduling with Submodular Guarantees13 Apr 2026
- 2026AI Agent Systems for Supply Chains: Structured Decision Prompts and Memory Retrieval5 Feb 2026
- 2026Submodular Evaluation Subset Selection in Automatic Prompt Optimization7 Jan 2026