Filip Rydin

Two-Stage Learned Decomposition for Scalable Routing on Multigraphs

This work splits the routing policy into a node permutation stage and an edge selection stage, and introduces a pre-encoding edge aggregation scheme and a non-autoregressive architecture for the edge stage, as well as a hierarchical reinforcement learning method to train the stages jointly.