paper-with-me

Papers

Practical Open-Loop Optimistic Planning

2019-04-09 · Edouard Leurent, Odalric-Ambrym Maillard

We consider the problem of online planning in a Markov Decision Process when given only access to a generative model, restricted to open-loop policies - i.e. sequences of actions - and under budget constraint. In this setting, the Open-Loop Optimistic Planning (OLOP) algorithm enjoys good theoretical guarantees but is overly conservative in practice, as we show in numerical experiments. We propose a modified version of the algorithm with tighter upper-confidence bounds, KLOLOP, that leads to better practical performances while retaining the sample complexity bound. Finally, we propose an efficient implementation that significantly improves the time complexity of both algorithms.

📄 PDF Abstract BibTeX arXiv:1904.04700

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Open-loop POMDP Simplification and Safe Skipping of Replanning with Formal Performance Guarantees

2026-04-01 · Da Kong, Vadim Indelman arxiv

Partially Observable Markov Decision Processes (POMDPs) provide a principled mathematical framework for decision-making under uncertainty. However, the exact solution to POMDPs is computationally intractable. In this pap…

Adaptive Thompson Sampling Stacks for Memory Bounded Open-Loop Planning

2019-07-11 · Thomy Phan, Thomas Gabor, Robert Müller, Christoph Roch 외

We propose Stable Yet Memory Bounded Open-Loop (SYMBOL) planning, a general memory bounded approach to partially observable open-loop planning. SYMBOL maintains an adaptive stack of Thompson Sampling bandits, whose size …

Thompson Sampling

Human-in-the-loop: Provably Efficient Preference-based Reinforcement Learning with General Function Approximation

2022-05-23 · Xiaoyu Chen, Han Zhong, Zhuoran Yang, Zhaoran Wang 외

We study human-in-the-loop reinforcement learning (RL) with trajectory preferences, where instead of receiving a numeric reward at each step, the agent only receives preferences over trajectory pairs from a human oversee…

Reinforcement Learning (RL)

Efficient Model-Based Reinforcement Learning through Optimistic Policy Search and Planning

2020-06-15 · NeurIPS 2020 12 · Sebastian Curi, Felix Berkenkamp, Andreas Krause

Model-based reinforcement learning algorithms with probabilistic dynamical models are amongst the most data-efficient learning methods. This is often attributed to their ability to distinguish between epistemic and aleat…

Model-based Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)

Open-Loop Planning, Closed-Loop Verification: Speculative Verification for VLA

2026-04-03 · Zihua Wang, Zhitao Lin, Ruibo Li, Yu Zhang 외 arxiv

Vision-Language-Action (VLA) models, as large foundation models for embodied control, have shown strong performance in manipulation tasks. However, their performance comes at high inference cost. To improve efficiency, r…