arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.08145cs.AI
收藏

非平稳环境下泛化规划与学习的认知探索

Epistemic Exploration for Generalizable Planning and Learning in Non-Stationary Settings

Arizona State University(亚利桑那州立大学);Lockheed Martin(洛克希德·马丁)

Rushang Karia, Pulkit Verma, Alberto Speranzon, Siddharth Srivastava

AI总结:

本文提出一种在非平稳随机环境中进行持续规划和模型学习的新框架,通过建模智能体知识缺口进行有针对性的探索以学习泛化概率模型,在样本复杂度上显著优于基线且具备理论收敛性。

摘要:

本文介绍了一种在关系型、非平稳随机环境中进行持续规划和模型学习的新方法。这种能力对于在不确定且不断演变的现实世界中部署序列决策系统至关重要。在具有未知(且非平稳)转移系统和任务不断变化的实际环境中,所提出的框架对智能体当前知识状态中的缺口进行建模,并利用这些缺口进行有针对性的调查性探索。使用这些探索收集的数据用于学习泛化的概率模型,以便在环境动态持续变化的情况下解决当前任务。在几个非平稳基准域上的实证评估表明,该方法在样本复杂度方面显著优于规划和RL基线。理论结果表明,当平稳性成立时,系统表现出理想的收敛性质。

英文摘要:

This paper introduces a new approach for continual planning and model learning in relational, non-stationary stochastic environments. Such capabilities are essential for the deployment of sequential decision-making systems in the uncertain and constantly evolving real world. Working in such practical settings with unknown (and non-stationary) transition systems and changing tasks, the proposed framework models gaps in the agent's current state of knowledge and uses them to conduct focused, investigative explorations. Data collected using these explorations is used for learning generalizable probabilistic models for solving the current task despite continual changes in the environment dynamics. Empirical evaluations on several non-stationary benchmark domains show that this approach significantly outperforms planning and RL baselines in terms of sample complexity. Theoretical results show that the system exhibits desirable convergence properties when stationarity holds.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑