Learning Differentiable Programs with Admissible Neural Heuristics Ameesh Shah

This relaxed program is differentiable and can be trained end-to-end, and the resulting training loss is an approximately admissible heuristic that can guide the combinatorial search.