跳到正文
arXiv cs.CL· Ryan Bahlous-Boldi, Isha Puri, Idan Shenfeld, Akarsh Kumar, Mehul Damani, Sebastian Risi, Omar Khattab, Zhang-Wei Hong, Pulkit Agrawal·· 11 小时前AI 评分58

VPO:面向多样性的强化学习训练提升测试时搜索效果

Vector Policy Optimization: Training for Diversity Improves Test-Time Search

AI 导读

论文提出 Vector Policy Optimization(VPO),一种显式训练策略预期多样化下游奖励函数并产出多样解的强化学习算法。VPO 利用实践中奖励常为向量值的特点,结合多答案提示与集合级奖励,训练 LLM 生成在向量奖励空间不同权衡上专精的解集。

正文 · 原文

View PDF HTML (experimental)

Abstract:Language models must now generalize out of the box to novel environments and work inside inference-scaling search procedures, such as AlphaEvolve, that select rollouts with a variety of task-specific reward functions. Unfortunately, the standard paradigm of LLM post-training optimizes a pre-specified scalar reward, often leading current LLMs to produce low-entropy response distributions and thus to struggle at displaying the diversity that inference-time search will require. We propose Vector Policy Optimization (VPO), an RL algorithm that explicitly trains policies to anticipate diverse downstream reward functions and to produce diverse solutions. VPO exploits that rewards are often vector-valued in practice, like per-test-case correctness in code generation or, say, multiple different user personas or reward models. VPO combines multi-answer prompting with a set-level reward to train the LLM to produce sets of solutions that specialize to different trade-offs in the vector reward space. Across four tasks, VPO matches or beats the strongest scalar RL baselines on test-time search (e.g. pass@k and best@k), with the gap widening as the search budget grows. For evolutionary search, VPO models unlock problems that GRPO models cannot solve at all. As test-time search becomes standard, diversity may need to become the default post-training objective.
Comments: Accepted to NeurIPS 2026
Subjects: Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Neural and Evolutionary Computing (cs.NE)
Cite as: arXiv:2605.22817 [cs.LG]
  (or arXiv:2605.22817v2 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2605.22817

arXiv-issued DOI via DataCite

Submission history

From: Ryan Bahlous-Boldi [view email]
[v1] Thu, 21 May 2026 17:59:26 UTC (404 KB)
[v2] Thu, 5 Nov 2026 16:59:48 UTC (383 KB)

来源:arXiv cs.CL · arxiv.org