GLAN: A Graph-based Linear Assignment Network. (arXiv:2201.02057v1 [cs.LG])

Differentiable solvers for the linear assignment problem (LAP) have attracted
much research attention in recent years, which are usually embedded into
learning frameworks as components. However, previous algorithms, with or
without learning strategies, usually suffer from the degradation of the
optimality with the increment of the problem size. In this paper, we propose a
learnable linear assignment solver based on deep graph networks. Specifically,
we first transform the cost matrix to a bipartite graph and convert the
assignment task to …

arxiv graph graph-based network