Name
Abstract | ||
|---|---|---|
Monte Carlo tree search (MCTS) algorithms can encounter difficulties when solving Markov decision processes (MDPs) in which the outcomes of actions are highly stochastic. This stochastic branching can be reduced through state abstraction. In online planning with a time budget, there is a complex tradeoff between loss in performance due to overly coarse abstraction versus gain in performance from reducing the problem size. Coarse but unsound abstractions often outperform sound abstractions for practical budgets. Motivated by this, we propose a progressive abstraction refinement algorithm that refines an initially coarse abstraction during search in order to match the abstraction to the sample budget. Our experiments show that the algorithm combines the strong performance of coarse abstractions at small sample budgets with the ability to exploit larger budgets for further performance gains. |
Year | Venue | Field |
|---|---|---|
2015 | UAI | Monte Carlo tree search,Abstraction,Computer science,Markov decision process,Exploit,Theoretical computer science,Sampling (statistics),Artificial intelligence,Abstraction inversion,Abstraction refinement,Machine learning,Branching (version control) |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
9 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jesse Hostetler | 1 | 45 | 4.25 |
| Alan Fern | 2 | 1528 | 111.59 |
| Thomas G. Dietterich | 3 | 9336 | 1722.57 |