arXiv:2501.18138cs.LG2025-01中稿 · the 25th Internati…被引 2

提出B3C方法,解决离线多智能体强化学习中的高估问题。

B3C: A Minimalist Approach to Offline Multi-Agent Reinforcement Learning

  • 用批评值裁剪和行为克隆正则化抑制高估
  • 在多个基准上超越现有最优算法
  • 适合研究离线多智能体学习的学者

离线强化学习中,策略评估时选择未见动作导致的高估是主要挑战。单智能体场景下,向现有在线RL算法添加行为克隆(BC)正则化已被证明有效;但在多智能体场景中,由于存在多个动作,高估问题更严重,基于BC正则化的方案容易出现过度正则化或评论器发散。为此,我们提出一种简单有效的方法——行为克隆正则化结合评论器裁剪(B3C),通过基于数据集最大回报裁剪目标评论器值,并提高RL目标权重相对于BC正则化的比例,从而提升性能。此外,我们利用现有的价值分解技术,特别是非线性分解(该技术在离线设置中尚未被充分研究)。结合非线性价值分解,B3C在多个离线多智能体基准上优于当前最先进算法。

原文摘要 · Abstract (English)

Overestimation arising from selecting unseen actions during policy evaluation is a major challenge in offline reinforcement learning (RL). A minimalist approach in the single-agent setting -- adding behavior cloning (BC) regularization to existing online RL algorithms -- has been shown to be effective; however, this approach is understudied in multi-agent settings. In particular, overestimation becomes worse in multi-agent settings due to the presence of multiple actions, resulting in the BC regularization-based approach easily suffering from either over-regularization or critic divergence. To address this, we propose a simple yet effective method, Behavior Cloning regularization with Critic Clipping (B3C), which clips the target critic value in policy evaluation based on the maximum return in the dataset and pushes the limit of the weight on the RL objective over BC regularization, thereby improving performance. Additionally, we leverage existing value factorization techniques, particularly non-linear factorization, which is understudied in offline settings. Integrated with non-linear value factorization, B3C outperforms state-of-the-art algorithms on various offline multi-agent benchmarks.

多智能体离线RL行为克隆价值分解

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