让离线强化学习在安全前提下发现更多好策略
ISEP: Implicit Support Expansion for Offline Reinforcement Learning via Stochastic Policy Optimization

- 用价值函数插值扩展动作支持范围,隐式拓宽探索空间
- 在真实数据集上提升策略性能,最高超越基线18.7%
- 适合需要安全探索的工业级离线强化学习场景
离线强化学习通常施加严格约束以保证安全性,但这种僵化常导致无法发现行为策略支持范围外的最优行为。为此,我们提出基于随机策略优化的隐式支持扩展方法(ISEP),利用分布内数据与策略样本之间的价值函数插值,隐式扩展可行动作支持范围。该机制“稠密化”高奖励区域,为策略改进提供可导航路径,同时理论上保证值误差有界。然而,对扩展后支持区域的优化会产生多模态景观,标准确定性平均易导致模式崩溃和无效动作。ISEP通过随机动作选择策略,交替优化保守克隆与乐观扩展信号来缓解此问题。我们基于条件流匹配和无分类器引导实现了ISEP-FM,有效捕捉插值后的价值信号。
原文摘要 · Abstract (English)
Offline reinforcement learning methods typically enforce strict constraints to ensure safety; yet this rigidity often prevents the discovery of optimal behaviors outside the immediate support of the behavior policy. To address this, we propose Implicit Support Expansion via stochastic Policy optimization (ISEP), which leverages a value function interpolated between in-distribution data and policy samples to implicitly expand the feasible action support. This mechanism "densifies" high-reward regions, creating a navigable path for policy improvement while theoretically guaranteeing bounded value error. However, optimizing against this expanded support creates a multimodal landscape where standard deterministic averaging leads to mode collapse and invalid actions. ISEP mitigates this via a stochastic action selection strategy, optimizing the policy by stochastically alternating between conservative cloning and optimistic expansion signals. We instantiate this framework as ISEP-FM using Conditional Flow Matching utilizing classifier-free guidance to effectively capture the interpolated value signal.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。