将无限时序的性能要求转化为平均奖励目标,实现无需重置的持续学习。
Average Reward Reinforcement Learning for Omega-Regular and Mean-Payoff Objectives
- 用绝对活度规范生成平均奖励目标,适配持续交互场景。
- 在未知通信马尔可夫决策过程上保证收敛,支持在线简化。
- 适合长期运行系统,如机器人控制与自动驾驶。
强化学习中奖励设计对行为塑造至关重要,但手动设计繁琐且易出错。一种更可靠的方法是用形式化语言明确行为需求,并自动转换为学习目标。ω-正则语言因其在形式验证中的作用而成为自然选择。然而,现有ω-正则强化学习多基于周期性重置的离散回合设置,与无限轨迹上的ω-正则语义不一致。对于持续任务(即单次无中断生命周期),平均奖励准则更为合适。本文聚焦于绝对活度规范——一类无法被有限前缀违反的ω-正则语言子类,天然契合持续交互。我们提出首个无需模型、无周期重置的平均奖励强化学习框架,能将绝对活度规范转化为平均奖励目标,并在未知通信马尔可夫决策过程(MDPs)中实现学习。同时引入字典序多目标优化机制:在满足绝对活度规范概率最大的策略中,进一步最大化外部平均奖励。方法在未知通信MDP上保证收敛,支持无需完整环境知识的在线约简,实现真正的模型无关学习。多个基准测试表明,该持续性平均奖励方法显著优于竞争性的折扣基方法。
原文摘要 · Abstract (English)
Recent advances in reinforcement learning (RL) have renewed interest in reward design for shaping agent behavior, but manually crafting reward functions is tedious and error-prone. A principled alternative is to specify behavioral requirements in a formal, unambiguous language and automatically compile them into learning objectives. $ω$-regular languages are a natural fit, given their role in formal verification and synthesis. However, most existing $ω$-regular RL approaches operate in an episodic, discounted setting with periodic resets, which is misaligned with $ω$-regular semantics over infinite traces. For continuing tasks, where the agent interacts with the environment over a single uninterrupted lifetime, the average-reward criterion is more appropriate. We focus on absolute liveness specifications, a subclass of $ω$-regular languages that cannot be violated by any finite prefix and thus aligns naturally with continuing interaction. We present the first model-free RL framework that translates absolute liveness specifications into average-reward objectives and enables learning in unknown communicating Markov decision processes (MDPs) without episodic resetting. We also introduce a reward structure for lexicographic multi-objective optimization: among policies that maximize the satisfaction probability of an absolute liveness specification, the agent maximizes an external average-reward objective. Our method guarantees convergence in unknown communicating MDPs and supports on-the-fly reductions that do not require full environment knowledge, enabling model-free learning. Experiments across several benchmarks show that the continuing, average-reward approach outperforms competing discount-based methods.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。