The University of Tokyo, Tokyo, Japan
Shinsaku Sakaue, Taihei Oki
sample complexity;data-driven algorithm design;heuristic search
Sample Complexity of Learning Heuristic Functions for Greedy-Best-First and A* Search