← Search

Forest Agostinelli

2 accepted papers

2026

Beyond Single-Step Updates: Reinforcement Learning of Heuristics with Limited-Horizon Search

AAAI 2026technical

Many sequential decision-making problems can be formulated as shortest-path problems, where the objective is to reach a goal state from a given starting state. Heuristic search is a standard approach for solving such problems, relying on a heuristic function to estimate the cost to the goal from any

Cited by 0Source ↗PDF ↗Scholar ↗
2019

Solving the Rubik's Cube with Approximate Policy Iteration

ICLR 2019poster

Recently, Approximate Policy Iteration (API) algorithms have achieved super-human proficiency in two-player zero-sum games such as Go, Chess, and Shogi without human data. These API algorithms iterate between two policies: a slow policy (tree search), and a fast policy (a neural network). In these t…

Cited by 52Source ↗PDF ↗Scholar ↗