Lune

ICLR2026顶会

C-Evolve: Consensus-based Evolution for Prompt Groups

Tiancheng Li, Yuhang Wang, Zhiyang Chen, Zijun Wang, Liyuan Ma, Guo-Jun Qi

摘要

Prompt evolution algorithms offer a powerful paradigm for enhancing AI systems based on closed-source models, while few work explores whether aggregating results from multiple prompts to reach a consensus can further advance the system capability boundary. In this paper, we introduce Consensus-Evolve (C-Evolve), an evolutionary algorithm that discovers a group of prompts whose aggregated outputs after majority voting achieve optimal performance. More specifically, C-Evolve employs an island-based evolutionary algorithm to maintain population diversity, and prompts from distinct islands are selected to form groups to aggregate their outputs. The key difference from single individual evolution is a voting score, which evaluates each individual prompt's contribution within groups. We take this as the fitness score for evolution instead of individual performance. Consequently, C-Evolve is more likely to produce and maintain prompts with higher potential to form a high-performing group and eliminate low-performing ones, gradually improving the group performance after reaching consensus. Our method achieves state-of-the-art performance across a wide range of tasks, including both open-ended tasks like HotpotQA and closed-ended tasks like MATH. On Qwen3-8B, C-Evolve achieves 70.67% on HotpotQA and 43.88% on IFBench, which are 4.95% and 2.73% higher than GEPA, respectively. For GPT-4.1-mini, the accuracy on IFBench is further improved to 47.96% and reaches 95.33% in the MATH benchmark. These results demonstrate the C-Evolve's competitive performance. INTRODUCTION The advancement of Large Language Models (LLMs) has significantly accelerated progress in natural language processing (Liu et al., 2024; Thirunavukarasu et al., 2023) . However, many state-of-theart models, such as GPT-4.1 (OpenAI, 2025) and Claude (Anthropic, 2024), remain closed-source and are accessible only via API interfaces. This restricts researchers from performing parameter fine-tuning to adapt these models to specific downstream tasks. To leverage the capabilities of such black-box models, a new paradigm prompt-based optimization methods have emerged (Opsahl-Ong et al.

问 Lune

尽管问,回答会引用原文。

Lune 会读完全文和相关的 Paper,每个回答都附上所依据的原文段落。

可以从这些问题问起

Lune 的依据

全文 · 相关的 Paper

获取答案

免费开始,无需绑卡

它引用的 Paper8

  1. Chain-of-Thought Prompting Elicits Reasoning in Large Language ModelsJason Wei, Xuezhi Wang, Dale Schuurmans, Maarten Bosma 等NeurIPS 2022 · 22,562 次引用
  2. SGLang: Efficient Execution of Structured Language Model ProgramsLianmin Zheng, Liangsheng Yin, Zhiqiang Xie, Chuyue Sun 等NeurIPS 2024 · 1,586 次引用
  3. Self-Consistency Improves Chain of Thought Reasoning in Language ModelsXuezhi Wang, Jason Wei, Dale Schuurmans, Quoc V. Le 等ICLR 2023 · 681 次引用
  4. Promptbreeder: Self-Referential Self-Improvement via Prompt EvolutionChrisantha Fernando, Dylan Banarse, Henryk Michalewski, Simon Osindero 等ICML 2024 · 432 次引用
  5. Large Language Models are Human-Level Prompt EngineersYongchao Zhou, Andrei Ioan Muresanu, Ziwen Han, Keiran Paster 等ICLR 2023 · 297 次引用

相关 Paper

  1. Auto-Evolve: Enhancing Large Language Model's Performance via Self-Reasoning FrameworkKrishna Aswani, Huilin Lu, Pranav Patankar, Priya Dhalwani 等EMNLP Findings 2024
  2. Connecting Large Language Models with Evolutionary Algorithms Yields Powerful Prompt OptimizersQingyan Guo, Rui Wang, Junliang Guo, Bei Li 等ICLR 2024 · 257 次引用
  3. GLaPE: Gold Label-agnostic Prompt Evaluation for Large Language ModelsXuanchang Zhang, Zhuosheng Zhang, Hai ZhaoEMNLP 2024 · 3 次引用
  4. ThetaEvolve: Test-time Learning on Open ProblemsYiping Wang, Shao-Rong Su, Zhiyuan Zeng, Eva Xu 等ICML 2026 · 44 次引用
  5. Dual-Phase Accelerated Prompt OptimizationMuchen Yang, Moxin Li, Yongle Li, Zijun Chen 等EMNLP Findings 2024
黄昏的海面,两侧是细线勾勒的悬崖