跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2608.02391 · v2

Cooperative Coevolution for Resource-Constrained Agentic LLM Post-Training

首次提交 2026-08-03 23:34
版本更新 2026-11-07 16:58
雷达观测 2026-11-10 11:14
arXiv ↗PDF ↗

摘要

Tool-using large language model (LLM) agents produce long, multi-turn trajectories, making gradient-based post-training memory-intensive. Evolution strategies (ES) enable memory-efficient full-parameter post-training without backpropagation and can eventually match the performance of gradient-based reinforcement learning (RL). However, resource-constrained settings typically offer only a few GPUs, so the high GPU-hour requirements of ES translate into prohibitively long training times. To address this, we introduce Cooperative Parameter-subspace Evolution Strategy (CoPES), a cooperative coevolutionary method that decomposes the full parameter space into lower-dimensional subspaces and searches over them cooperatively to improve optimization efficiency. On Qwen3.5-4B math, CoPES recovers 92% of full-parameter GRPO's validation-accuracy gain within the GPU-hour budget of GRPO's best validation checkpoint, versus 67% for standard ES. Its theoretical GPU memory requirement is less than one-eighth that of full-parameter GRPO. It consistently outperforms standard ES and LoRA-based GRPO on all evaluated pass@k metrics across five math benchmarks. CoPES's gains extend to Qwen3.5-9B with unchanged optimization hyperparameters and to multi-hop QA. These results demonstrate an improved trade-off between memory requirements and training time for agentic LLM post-training under resource constraints. The code is open-sourced in https://github.com/MetaronWang/CoPES

作者备注:20 pages,14 figures, submit to AAAI 2027

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只观测到一个版本,无法比较变化。之后收录新版本时,会在这里对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-11-07 16:58 · 最新观测版本

Cooperative Coevolution for Resource-Constrained Agentic LLM Post-Training

Tool-using large language model (LLM) agents produce long, multi-turn trajectories, making gradient-based post-training memory-intensive. Evolution strategies (ES) enable memory-efficient full-parameter post-training without backpropagation and can eventually match the performance of gradient-based reinforcement learning (RL). However, resource-constrained settings typically offer only a few GPUs, so the high GPU-hour requirements of ES translate into prohibitively long training times. To address this, we introduce Cooperative Parameter-subspace Evolution Strategy (CoPES), a cooperative coevolutionary method that decomposes the full parameter space into lower-dimensional subspaces and searches over them cooperatively to improve optimization efficiency. On Qwen3.5-4B math, CoPES recovers 92% of full-parameter GRPO's validation-accuracy gain within the GPU-hour budget of GRPO's best validation checkpoint, versus 67% for standard ES. Its theoretical GPU memory requirement is less than one-eighth that of full-parameter GRPO. It consistently outperforms standard ES and LoRA-based GRPO on all evaluated pass@k metrics across five math benchmarks. CoPES's gains extend to Qwen3.5-9B with unchanged optimization hyperparameters and to multi-hop QA. These results demonstrate an improved trade-off between memory requirements and training time for agentic LLM post-training under resource constraints. The code is open-sourced in https://github.com/MetaronWang/CoPES

查看此版本解读 →查看此版本原文 ↗