Agent-GWO: Collaborative Agents for Dynamic Prompt Optimization in Large Language Models (2026.findings-acl)
Copied to clipboard
Xudong Wang, Chaoning Zhang, Chenghao Li, Shuxu Chen, Qigan Sun, Jiaquan Zhang, Fachrina Dewi Puspitasari, Tae-Ho Kim, Jiwei Wei, Malu Zhang, Guoqing Wang, Yang Yang, Heng Tao Shen
| Challenge: | Existing automatic prompt optimization methods fail to optimize prompts and decoding hyperparameters within a unified framework to achieve stable global improvements. |
| Approach: | They propose a dynamic prompt optimization framework for complex reasoning that unifies prompt templates and decodes hyperparameters as inheritable agent configurations. |
| Outcome: | Experiments on multiple mathematical and hybrid reasoning benchmarks show that Agent-GWO improves accuracy and stability over existing prompt optimization methods. |
Similar Papers
MAPRO: Recasting Multi-Agent Prompt Optimization as Maximum a Posteriori Inference (2026.findings-eacl)
Copied to clipboard
| Challenge: | Large language models (LLMs) have demonstrated remarkable capabilities across diverse tasks. |
| Approach: | They propose a framework that optimizes MAS prompts as a maximum a posteriori problem and then iteratively updates agent prompts. |
| Outcome: | The proposed framework surpasses manual and automated benchmarks in multiple tasks and provides general guidelines for building more reliable and principled multi-agent systems in the future. |
CoMM: Collaborative Multi-Agent, Multi-Reasoning-Path Prompting for Complex Problem Solving (2024.findings-naacl)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have shown great ability in solving traditional natural language tasks and elementary reasoning tasks with appropriate prompting techniques. |
| Approach: | They propose a collaborative multi-agent, multi-reasoning-path prompting framework that prompts LLMs to play different roles in a problem-solving team and encourages different role-play agents to collaboratively solve the target task. |
| Outcome: | The proposed framework is applied to two college-level science problems over competitive baselines. |
Prompt-R1: Collaborative Automatic Prompting Framework via End-to-end Reinforcement Learning (2026.findings-acl)
Copied to clipboard
Wenjin Liu, Haoran Luo, Xueyuan Lin, Haoming Liu, Tiesunlong Shen, Jiapu Wang, Rui Mao, Erik Cambria
| Challenge: | Existing large language models are limited in understanding, reasoning, calculation, and generation, limiting their performance in complex reasoning and dynamic tasks. |
| Approach: | They propose a plug-and-play framework that integrates a small-scale LLM (as agent) with large-scale large-level LLMs (a as environment) they propose generating prompts that are used to interact with LLM, and a double constraint reward that optimizes correctness and quality of generation. |
| Outcome: | The proposed framework significantly outperforms baseline large-scale large-language models across various tasks. |
GenDLN: Evolutionary Algorithm-Based Stacked LLM Framework for Joint Prompt Optimization (2025.acl-srw)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are increasingly replacing traditional classification and inference models due to their generality, ability to perform a wide range of tasks, and seemingly advanced "reasoning" prompt optimization is a promising alternative to manual/human prompt engineering, but the cost of using LLMs for prompt optimization via commercial APIs remains high. |
| Approach: | They propose an open-source, efficient genetic algorithm-based prompt pair optimization framework that leverages commercial APIs. |
| Outcome: | The proposed approach allows teams with limited resources to efficiently use commercial LLMs for prompt optimization. |
promptolution: A Unified, Modular Framework for Prompt Optimization (2026.eacl-demo)
Copied to clipboard
| Challenge: | Existing implementations of prompt optimization are tied to unmaintained, isolated codebases or require invasive integration into application frameworks. |
| Approach: | They propose a unified, modular open-source framework that integrates multiple contemporary discrete prompt optimizers within a single extensible system for both practitioners and researchers. |
| Outcome: | The proposed framework integrates multiple discrete prompt optimizers, supports systematic and reproducible benchmarking, and returns framework-agnostic prompt strings, enabling seamless integration into existing LLM pipelines while remaining agnosite to the underlying model implementation. |
Gradient-Guided Multi-Judge Prompt Optimization (2026.acl-long)
Copied to clipboard
ChenZhuo Zhao, Xinda Wang, Pu Zhao, Yue Huang, Junting Lu, Ziqian Liu, Qingwei Lin, Saravan Rajmohan, Dongmei Zhang
| Challenge: | Existing approaches to prompt optimization trade off signal quality against computational cost. |
| Approach: | They propose a framework that uses a first-order gradient approximation to score segment importance in a continuous masking direction. |
| Outcome: | The proposed framework improves efficiency and robustness by using a first-order gradient approximation to score segment importance in a continuous masking direction. |
Prompt Compression for Large Language Models: A Survey (2025.naacl-long)
Copied to clipboard
| Challenge: | Current methods for improving LLM efficiency focus on optimizing the model itself, while prompt-centric methods focus on lowering the complexity of input. |
| Approach: | They propose to use prompt compression to optimize the compression encoder and combine hard and soft prompt methods to improve the efficiency of LLMs. |
| Outcome: | The proposed methods are categorized into hard prompt methods and soft prompt methods. |
MutantPrompt: Prompt Optimization via Mutation Under a Budget on Modest-sized LMs (2025.findings-acl)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have revolutionized the way we learn and process information, but identifying optimal prompts remains a challenge for low-resource languages. |
| Approach: | They propose a framework that leverages multi-armed bandit algorithms to efficiently identify optimal prompts tailored to low-resource languages. |
| Outcome: | The proposed framework is able to find optimal prompts for low-resource languages and significantly improves performance across multiple low-level tasks. |
PMPO: Probabilistic Metric Prompt Optimization for Small and Large Language Models (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods evaluate candidate prompts by sampling full outputs, often coupled with self critique or human annotated preferences, which limits scalability, especially for smaller models or models that are not instruction tuned. |
| Approach: | They propose a framework that uses token level cross entropy as a direct, lightweight evaluation signal to evaluate candidate prompts. |
| Outcome: | The proposed framework outperforms prior prompt optimizers across model sizes and datasets. |
iPrOp: Interactive Prompt Optimization for Large Language Models with a Human in the Loop (2025.acl-srw)
Copied to clipboard
| Challenge: | Prompt engineering has made significant contributions to the era of large language models, yet its effectiveness depends on the skills of a prompt author. |
| Approach: | They propose a novel approach to prompt optimization that bridges manual prompt engineering and automatic prompt optimization by providing task-specific guidance. |
| Outcome: | The proposed approach bridges manual prompt engineering and automatic prompt optimization while offering users the flexibility to assess evolving prompts. |