arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2604.14974cs.LGstat.ML
收藏

在铺设道路之前击败路径:样本高效的蒙特卡洛规划

Blazing the trails before beating the path: Sample-efficient Monte-Carlo planning

SequeL team, INRIA Lille - Nord Europe(SequeL团队,INRIA里尔-北欧分校);Google DeepMind(谷歌DeepMind)

Jean-Bastien Grill, Michal Valko, Rémi Munos

AI总结:

本文提出TrailBlazer算法,通过高效样本探索近优状态结构,实现样本效率高的蒙特卡洛规划,兼顾策略优化与计算效率。

摘要:

你是一个机器人,生活在马尔可夫决策过程(MDP)中,拥有生成模型进行蒙特卡洛规划。你希望规划高效,通过探索少量近优状态,获得依赖于近优状态数量的样本复杂度保证。TrailBlazer算法扩展了蒙特卡洛采样,用于交替最大化与期望的问题,实现简单且计算高效。

英文摘要:

You are a robot and you live in a Markov decision process (MDP) with a finite or an infinite number of transitions from state-action to next states. You got brains and so you plan before you act. Luckily, your roboparents equipped you with a generative model to do some Monte-Carlo planning. The world is waiting for you and you have no time to waste. You want your planning to be efficient. Sample-efficient. Indeed, you want to exploit the possible structure of the MDP by exploring only a subset of states reachable by following near-optimal policies. You want guarantees on sample complexity that depend on a measure of the quantity of near-optimal states. You want something, that is an extension of Monte-Carlo sampling (for estimating an expectation) to problems that alternate maximization (over actions) and expectation (over next states). But you do not want to StOP with exponential running time, you want something simple to implement and computationally efficient. You want it all and you want it now. You want TrailBlazer.

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

↑