AINeutralarXiv – CS AI · Mar 34/104
🧠
Learning Shortest Paths with Generative Flow Networks
Researchers present a novel framework using Generative Flow Networks (GFlowNets) to solve shortest path problems in graphs. The method proves that minimizing total flow forces GFlowNets to traverse only shortest paths, demonstrating competitive performance in pathfinding tasks including solving Rubik's Cubes with smaller search budgets than existing approaches.