mlsanityData to 14 Oct 2026

CRAFT: Cost-aware Refinement And Front-aware Tuning of Prompts

arXiv 2606.04661 ↗First posted 3 Jun 2026cs.CL cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Prompts tuned for accuracy often grow long, raising inference cost on every model call. The best accuracy-cost trade-off depends on the task and the budget, so prompt optimization is a search over the Pareto front of accuracy and prompt-token cost rather than for one prompt. The usual shortcut, collapsing the objectives into a weighted sum, fixes the trade-off weight before search and often recovers only a narrow region of the front, a failure we call scalarization collapse. We present CRAFT (Cost-aware Refinement And Front-aware Tuning), a Pareto-front prompt optimizer that treats target-LLM validation calls as the scarce resource and allocates them to candidates near the optimistic candidate front. Each round, complementary accuracy-oriented and cost-oriented generators propose edits, Pareto-gap acquisition spends the per-round validation budget, and NSGA-II retention keeps a spread-out population. Across six classification and reasoning benchmarks, CRAFT's retained fronts reach both high-accuracy and low-cost regions, while accuracy-only, cost-only, and weighted-sum baselines each concentrate in narrower regions. The accuracy-cost trade-off becomes a post-search choice, not a pre-search weight.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 20 of its 40 references that are in the map. First posted on arXiv 3 Jun 2026.

Builds on

20 of 40 references.

References · 20

  1. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
  2. 2022Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Themcited by 1,807
  3. 2021Calibrate Before Use: Improving Few-Shot Performance of Language Modelscited by 1,392
  4. 2026DeepSeek-V4: Towards Highly Efficient Million-Token Context Intelligencecited by 1,040
  5. 2019How Can We Know What Language Models Know?cited by 959
  6. 2023BeaverTails: Towards Improved Safety Alignment of LLM via a Human-Preference Datasetcited by 860
  7. 2023FrugalGPT: How to Use Large Language Models While Reducing Cost and Improving Performancecited by 853
  8. 2023Automatic Prompt Optimization with "Gradient Descent" and Beam Searchcited by 653
  9. 2020GoEmotions: A Dataset of Fine-Grained Emotionscited by 486
  10. 2023Learning to Compress Prompts with Gist Tokenscited by 390
  11. 2022RLPrompt: Optimizing Discrete Text Prompts with Reinforcement Learningcited by 366
  12. 2024LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compressioncited by 348
8 more
  1. 2023Hard Prompts Made Easy: Gradient-Based Discrete Optimization for Prompt Tuning and Discoverycited by 336
  2. 2023Large Language Model Cascades with Mixture of Thoughts Representations for Cost-efficient Reasoningcited by 143
  3. 2021Parallel Bayesian Optimization of Multiple Noisy Objectives with Expected Hypervolume Improvementcited by 118
  4. 2025A Systematic Survey of Automatic Prompt Optimization Techniquescited by 63
  5. 2024Symbolic Prompt Program Search: A Structure-Aware Approach to Efficient Compile-Time Prompt Optimizationcited by 30
  6. 2023InstOptima: Evolutionary Multi-objective Instruction Optimization via Large Language Model-based Instruction Operatorscited by 17
  7. 2024SCULPT: Systematic Tuning of Long Promptscited by 9
  8. 2024MOPO: Multi-Objective Prompt Optimization for Affective Text Generationcited by 9

Built on by

Not cited yet.