Your GFlowNet Secretly Learns an Optimal Transport Plan 事件

Your GFlowNet Secretly Learns an Optimal Transport Plan arXiv:2606.06272v1 Announce Type: cross Abstract: Generative Flow Networks (GFlowNets) are a framework for sampling structured objects via stochastic trajectories in a directed graph. In this work, we establish a theoretical connection between non-acyclic GFlowNets and optimal transport (OT). We show that fixing the initial flow distribution in a minimum-flow GFlowNet reduces its objective to a Kantorovich OT problem with graph-induced sho