面向推理时目标的分层策略学习
Learning Stratified Policies for Inference-Time Objectives
Mridul Mahajan, Xuezhou Zhang, Aldo Pacchiano
AI 速读 基于摘要
作者提出将推理时的采样预算分配给一组互补的 LoRA 策略(分层策略),以提升大语言模型的 pass@k 表现。
cs.LG · cs.AI
查看原文摘要
Inference-time scaling improves the performance of large language models by sampling multiple responses and evaluating their collective utility. However, many existing approaches obtain these samples by repeatedly sampling from a single policy. In this work, we study if the sample budget at inference time can instead be allocated across a population of policies. We introduce stratified policies, where each of $k$ learned policies contributes one response to a $k$-sample inference-time objective. We realize this policy population using separate LoRA adapters on a shared language model backbone and optimize it for pass@$k$. We theoretically motivate the approach by analyzing the linear setting; a population of LoRAs can achieve zero best-of-$k$ approximation error in settings where every single LoRA has strictly positive prediction error. Empirically, we demonstrate that stratified policies consistently improve pass@$k$ over a single-policy baseline across multiple reasoning tasks. Overall, our results highlight how distributing samples across complementary policies can be a more effective use of sample budget than repeated i.i.d. sampling from a single policy at inference time.