33 citations · 84 across the 12 of their papers we have counts for
Showing cs.AIShow all
3 papers · 1 filter
cs.AI2023
Lightweight Online Learning for Sets of Related Problems in Automated Reasoning
Haoze Wu, Christopher Hahn, Florian Lonsing +3
We present Self-Driven Strategy Learning (), a lightweight online learning methodology for automated reasoning tasks that involve solving a set of related problems.…
cs.AI2022★ 5 cited
Lookahead Pathology in Monte-Carlo Tree Search
Khoi P. N. Nguyen, Raghuram Ramanujan
Monte-Carlo Tree Search (MCTS) is a search paradigm that first found prominence with its success in the domain of computer Go. Early theoretical work established the soundness and…
cs.AI2012★ 25 cited
Understanding Sampling Style Adversarial Search Methods
Raghuram Ramanujan, Ashish Sabharwal, Bart Selman
UCT has recently emerged as an exciting new adversarial reasoning technique based on cleverly balancing exploration and exploitation in a Monte-Carlo sampling setting. It has been…