arXiv:2605.12379cs.LGcs.AI2026-05

提出DRIFT方法,让离线训练的策略在在线学习中稳定提升性能。

Discrete Flow Matching for Offline-to-Online Reinforcement Learning

论文配图:Discrete Flow Matching for Offline-to-Online Reinforcement Learning
图 1 · 摘自论文原文
  • 用优势加权的离散流匹配更新预训练的连续时间马尔可夫链策略
  • 路径空间正则化保持预训练知识,候选集近似加速大动作空间学习
  • 适合需要从静态数据迁移并持续优化的离线转在线强化学习场景

许多强化学习任务具有离散动作空间,但基于扩散和流匹配的生成式策略方法多针对连续控制。生成式策略通常严重依赖离线数据,而离线到在线强化学习本身具有挑战性:策略需在新交互中改进,同时不丢失从静态数据中学到的有效行为。为此,我们提出DRIFT,一种在线微调方法,通过优势加权的离散流匹配损失更新预训练的连续时间马尔可夫链(CTMC)策略。为保留有用的预训练知识,我们引入路径空间惩罚项,正则化整个CTMC轨迹分布,而非仅最终动作分布。针对大离散动作空间,我们设计候选集近似机制,仅对从参考策略回滚和均匀探索中采样的小动作子集进行演员更新。理论分析表明,候选集误差受遗漏目标概率质量控制,且当候选集覆盖更多高概率动作时,诱导的CTMC生成器误差下降。在主流离散动作强化学习任务上的实验显示,该方法在所有任务上均实现稳定提升,在杰里科(Jericho)任务中使用简单GRU编码器取得最高平均得分,优于使用预训练语言模型的方法。受控实验进一步证实,路径空间惩罚在微调过程中保持有界,且CTMC生成器比确定性基线更快适应奖励偏移。候选集机制经稳定性分析验证:生成器误差随候选覆盖率呈指数下降。

原文摘要 · Abstract (English)

Many reinforcement learning (RL) tasks have discrete action spaces, but most generative policy methods based on diffusion and flow matching are designed for continuous control. Meanwhile, generative policies usually rely heavily on offline datasets and offline-to-online RL is itself challenging, as the policy must improve from new interaction without losing useful behavior learned from static data. To address those challenges, we introduce DRIFT, an online fine-tuning method that updates an offline pretrained continuous-time Markov chain (CTMC) policy with an advantage-weighted discrete flow matching loss. To preserve useful pretrained knowledge, we add a path-space penalty that regularizes the full CTMC trajectory distribution, rather than only the final action distribution. For large discrete action spaces, we introduce a candidate-set approximation that updates the actor over a small subset of actions sampled from reference-policy rollouts and uniform exploration. Our theoretical analysis shows that the candidate-set error is controlled by missing target probability mass, and the induced CTMC generator error decreases as the candidate set covers more high-probability actions. Experiments on prevailing discrete action RL task show that our method provides stable offline-to-online improvement across all tasks, achieving the highest average score on Jericho with a simple GRU encoder while outperforming methods that use pretrained language models. Controlled experiments further confirm that the path-space penalty remains bounded during fine-tuning and that the CTMC generator adapts to shifted rewards faster than deterministic baselines. The candidate-set mechanism is supported by a stability analysis showing that the generator error decreases exponentially with candidate coverage.

强化学习离线到在线生成策略离散动作

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。