2 citations · 4 across the 4 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2021★ 1 cited
Measurable Monte Carlo Search Error Bounds
John Mern, Mykel J. Kochenderfer
Monte Carlo planners can often return sub-optimal actions, even if they are guaranteed to converge in the limit of infinite samples. Known asymptotic regret bounds do not provide a…
cs.AI2020
Bayesian Optimized Monte Carlo Planning
John Mern, Anil Yildiz, Zachary Sunberg +2
Online solvers for partially observable Markov decision processes have difficulty scaling to problems with large action spaces. Monte Carlo tree search with progressive widening at…