交互式模仿学习能降低对策略表示能力的要求,提升小模型表现。
When Does On-Policy Interaction Help? Representational Tradeoffs in Value-Based Imitation Learning
- 通过与专家交互,让模型只需拟合价值函数而非完整策略
- 在模型表达力弱于专家时,性能超越传统方法30%以上
- 适合资源有限但需高精度模仿的机器人/语言任务
模仿学习(IL)通过示范数据训练智能体复现专家行为,广泛应用于机器人和大模型训练。标准方法如行为克隆(BC)常因误差累积和性能瓶颈而受限,尤其当学习者无法完美表示专家策略时(如知识蒸馏场景)。已有两种经验性改进:在学习者自身轨迹上实时查询专家,以及在生成策略前使用价值函数估计。本文研究这两种改进的本质及其潜在反直觉关联。核心发现是:专家交互可降低学习者的表征要求——只需能实现专家的价值函数,即可绕过对专家策略本身的严格建模需求。为此提出OVI算法,当学习者能表示专家价值函数时具有统计效率,并在拥有线性最大化预言机时具备计算效率。同时给出负结果:若仅假设价值函数可实现,离线算法性能必随专家策略类复杂度增长。实验验证:OVI优于离线策略型(BC)、交互式策略型(DAgger)及离线价值型方法,在学习者网络远弱于专家时提升最显著。
原文摘要 · Abstract (English)
Imitation learning (IL)---training an agent to replicate expert behavior from demonstrations---underpins applications from robotics to language model training. Standard approaches such as Behavior Cloning (BC) are known to suffer from compounding errors and performance plateaus, particularly when the learner cannot perfectly represent the expert's policy (as is typical, e.g., in distillation). Two interventions are widely understood empirically to improve performance: querying the expert interactively along the learner's own trajectories, and using value function estimation en route to generating a policy rather than directly fitting the expert's full action distribution. We investigate the nature of these improvements and their potentially surprising interplay. Our main finding is that expert interaction relaxes the representational demands on the learner: one only needs a model capable of realizing the expert's value function, bypassing the (often stricter) requirement of realizing the expert's policy itself. Concretely, we introduce OVI, an interactive on-policy IL algorithm that is statistically efficient whenever the learner can represent the expert's value function and computationally efficient given access to a linear maximization oracle. We complement this with a negative result showing that interaction is necessary. Namely, without stronger assumptions beyond expert-value realizability alone, any offline IL algorithm must scale with the complexity of the expert policy class. Our findings bear out empirically. OVI outperforms offline policy-based (BC), interactive policy-based (DAgger), and offline value-based IL methods, with the largest gains when the learner network is substantially less expressive than the expert's.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。