Active Reinforcement Learning with Monte-Carlo Tree Search

2018-03-13 · Sebastian Schulze, Owain Evans

Active Reinforcement Learning (ARL) is a twist on RL where the agent observes reward information only if it pays a cost. This subtle change makes exploration substantially more challenging. Powerful principles in RL like optimism, Thompson sampling, and random exploration do not help with ARL. We relate ARL in tabular environments to Bayes-Adaptive MDPs. We provide an ARL algorithm using Monte-Carlo Tree Search that is asymptotically Bayes optimal. Experimentally, this algorithm is near-optimal on small Bandit problems and MDPs. On larger MDPs it outperforms a Q-learner augmented with specialised heuristics for ARL. By analysing exploration behaviour in detail, we uncover obstacles to scaling up simulation-based algorithms for ARL.

📄 PDF Abstract BibTeX arXiv:1803.04926

Code (0)

등록된 구현이 없습니다.

Tasks

reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)Thompson Sampling

Methods 이 논문이 사용한 방법론

Monte-Carlo Tree Search Monte-Carlo Tree Search is a planning algorithm that accumulates value estimates obtained from Monte Carlo simulations in order to successively direct simulations towards more…

Hedging of Financial Derivative Contracts via Monte Carlo Tree Search

2021-02-11 · Oleg Szehr

The construction of approximate replication strategies for pricing and hedging of derivative contracts in incomplete markets is a key problem of financial engineering. Recently Reinforcement Learning algorithms for hedgi…

Q-Learning reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)

StarCraft II Build Order Optimization using Deep Reinforcement Learning and Monte-Carlo Tree Search

2020-06-12 · Islam Elnabarawy, Kristijana Arroyo, Donald C. Wunsch II

The real-time strategy game of StarCraft II has been posed as a challenge for reinforcement learning by Google's DeepMind. This study examines the use of an agent based on the Monte-Carlo Tree Search algorithm for optimi…

Deep Reinforcement Learning reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)+2

Online Test Synthesis From Requirements: Enhancing Reinforcement Learning with Game Theory

2024-07-26 · Ocan Sankur, Thierry Jéron, Nicolas Markey, David Mentré 외

We consider the automatic online synthesis of black-box test cases from functional requirements specified as automata for reactive implementations. The goal of the tester is to reach some given state, so as to satisfy a …

Solve Traveling Salesman Problem by Monte Carlo Tree Search and Deep Neural Network

2020-05-14 · Zhihao Xing, Shikui Tu, Lei Xu

We present a self-learning approach that combines deep reinforcement learning and Monte Carlo tree search to solve the traveling salesman problem. The proposed approach has two advantages. First, it adopts deep reinforce…

Deep Reinforcement Learning reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)+2

Is Monte Carlo Tree Search Just Every-Visit Monte Carlo Control?

2026-08-28 · Xianyi Wu arxiv

Monte Carlo Tree Search (MCTS) and every-visit Monte Carlo (MC) control are usually presented as different methods. MCTS is described in the language of search (selection, expansion, simulation, and backup), whereas MC c…

Reinforcement Learning